You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
None
This text by a master in the field covers recursive convergence, recursive and relative continuity, recursive and relative differentiability, the relative integral, elementary functions, and transfinite ordinals. 1961 edition.
Formal Systems and Recursive Functions
What can computers do in principle? What are their inherent theoretical limitations? The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function - a function whose values can be calculated in an automatic way.
Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
This monograph carries out the program which the author formulated in earlier work, the formalization of the theory of recursive functions of type 0 and 1 and of the theory of realizability.
The task of developing algorithms to solve problems has always been considered by mathematicians to be an especially interesting and im portant one. Normally an algorithm is applicable only to a narrowly limited group of problems. Such is for instance the Euclidean algorithm, which determines the greatest common divisor of two numbers, or the well-known procedure which is used to obtain the square root of a natural number in decimal notation. The more important these special algorithms are, all the more desirable it seems to have algorithms of a greater range of applicability at one's disposal. Throughout the centuries, attempts to provide algorithms applicable as widely as possible were rat...