## Home > Tags: recursion (Total 9 Records)

### Recursion via Pascal (Cambridge Computer Science Texts)

Computer Science By:Rohl 1984-08-31 00:00:00

This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has Computer Science

### Recursion via Pascal (Cambridge Computer Science Texts)

Algorithms By:Rohl 1984-08-31 00:00:00

This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has cambridge computer science, science texts, pascal, recursion, functional programming

### Recursion via Pascal (Cambridge Computer Science Texts)

Algorithms By:Rohl 1984-08-31 00:00:00

This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has cambridge computer science, science texts, pascal, recursion, solution

### Computability Theory: An Introduction to Recursion Theory

Computer Science By:Herbert B. Enderton 2010-12-16 00:00:00

Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logi computability theory, recursion theory, frequent historical information, recursion theorycomputability theory, complexity theorcomputability theory

Tags:
*theory*
*computability*
*recursion*

### Symmetries and Recursion Operators for Classical and Supersymmetric Differential Equations (Mathematics and Its Applications)

Computer Science By:I.S. Krasil'shchik, P.H. Kersten 2000-05-31 00:00:00

This book is a detailed exposition of algebraic and geometrical aspects related to the theory of symmetries and recursion operators for nonlinear partial differential equations (PDE), both in classical and in super, or graded, versions. It contains an original theory of Frolicher-Nijenhuis brackets recursion operators, differential equations, supersymmetric differential equations, theory, unknown recursion operators

Tags:
*application*
*mathematics*
*classical*
*recursion*
*differential*
*equations*
*operators*
*symmetries*
*supersymmetric*

### Higher Recursion Theory (Perspectives in Mathematical Logic)

Programming By:Gerald E. Sacks 1990-12-03 00:00:00

Hyperarithmetic theory is the first step beyond classical recursion theory. It is the primary source of ideas and examples in higher recursion theory. It is also a crossroad for several areas of mathematical logic: in set theory it is an initial segment of Godel's L; in model theory, the least admis theory, recursion theory, mathematical logic, classical recursion theory, hyperarithmetic theory

### Recursion Theory for Metamathematics (Oxford Logic Guides)

Computer Science By:Raymond M. Smullyan 1993-00-00 00:00:00

This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incomp oxford logic guides, incompleteness theorem, recursion theory, peano arithmetic, field.recursion theory

### Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125)

Computer Science By:Piergiorgio Odifreddi 1992-00-00 00:00:00

1988 marked the first centenary of Recursion Theory, since Dedekindâ€™s 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approach recursion theory, natural numbers, foundation.classical recursion theory, various equivalent approaches, complete algebraic characterization

Tags:
*sets*
*theory*
*foundations*
*mathematics*
*function*
*natural*
*classical*
*logic*
*recursion*
*studies*
*numbers*

### Recursion via Pascal

Programming By:J.S.Rohl 1984-00-00 00:00:00

This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has recursion, programming, simple linear recursion, solution, binary recursion