fixed-point theorem (in computability theory)
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Kleene's_recursion_theorem
|
| gptkbp:appliesTo |
Turing machines
partial computable functions |
| gptkbp:category |
recursion theory
theoretical computer science |
| gptkbp:field |
computability theory
|
| gptkbp:firstPublished |
1938
|
| https://www.w3.org/2000/01/rdf-schema#label |
fixed-point theorem (in computability theory)
|
| gptkbp:implies |
existence of self-referential programs
|
| gptkbp:namedAfter |
gptkb:Stephen_Kleene
|
| gptkbp:relatedTo |
gptkb:Gödel's_incompleteness_theorems
gptkb:Rice's_theorem fixed-point combinator |
| gptkbp:state |
For any computable function f, there exists an index e such that the function computed by e is the same as the function computed by f(e).
|
| gptkbp:usedIn |
recursion theory
proofs of undecidability self-replicating programs |
| gptkbp:bfsParent |
gptkb:Kleene's_recursion_theorem
|
| gptkbp:bfsLayer |
6
|