Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Recursive Functions
  • Language: en
  • Pages: 308

Recursive Functions

  • Type: Book
  • -
  • Published: 1967
  • -
  • Publisher: Unknown

None

Formal Systems and Recursive Functions
  • Language: en
  • Pages: 328

Formal Systems and Recursive Functions

  • Type: Book
  • -
  • Published: 1965
  • -
  • Publisher: Unknown

None

Recursive Functions in Computer Theory
  • Language: en
  • Pages: 192

Recursive Functions in Computer Theory

  • Type: Book
  • -
  • Published: 1981
  • -
  • Publisher: Unknown

None

Recursive Analysis
  • Language: en
  • Pages: 213

Recursive Analysis

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
  • Language: en
  • Pages: 329

Formal Systems and Recursive Functions

  • Type: Book
  • -
  • Published: 2000-04-01
  • -
  • Publisher: Elsevier

Formal Systems and Recursive Functions

Computability
  • Language: en
  • Pages: 268

Computability

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.

An Early History of Recursive Functions and Computability
  • Language: en
  • Pages: 312

An Early History of Recursive Functions and Computability

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.

Formalized Recursive Functionals and Formalized Realizability
  • Language: en
  • Pages: 110

Formalized Recursive Functionals and Formalized Realizability

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.

Theory of Recursive Functions and Effective Computability
  • Language: en
  • Pages: 526

Theory of Recursive Functions and Effective Computability

  • Type: Book
  • -
  • Published: 1967
  • -
  • Publisher: Unknown

None

Enumerability, Decidability, Computability
  • Language: en
  • Pages: 255

Enumerability, Decidability, Computability

  • Type: Book
  • -
  • Published: 2013-03-14
  • -
  • Publisher: Springer

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...