Kleene's recursion theorem
Theorem in computability theory
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics.
Nº Q1933521 ★
Común · Saberes
Kleene's recursion theorem
Theorem in computability theory
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics. A related theorem, which constructs fixed points of a computable function, is known as Rogers's theorem and is due to Hartley Rogers, Jr. The recursion theorems can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions.
Texto: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
-
Stephen Kleene
Lógico y matemático estadounidense (1909-1994)
Nº Q335148 ★
Sin ofertas
-
Función de Ackermann
Función matemática
Nº Q341835 ★★
Sin ofertas
-
Jerarquía aritmética
Nº Q669094 ★
Sin ofertas
-
T
Teorema del punto fijo de Lefschetz
Nº Q657469 ★
Sin ofertas
-
Teorema del punto fijo de Kakutani
Nº Q518524 ★
Sin ofertas
-
Teorema del punto fijo de Brouwer
Nº Q1144897 ★★
Sin ofertas