Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:fixed-point_theorem_(in_computability_theory)
|
| gptkbp:appliesTo |
Turing machines
partial recursive functions |
| gptkbp:author |
gptkb:Stephen_Cole_Kleene
|
| gptkbp:field |
gptkb:logic
computability theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Kleene's recursion theorem
|
| gptkbp:namedAfter |
gptkb:Stephen_Cole_Kleene
|
| gptkbp:publishedIn |
gptkb:Duke_Mathematical_Journal
|
| gptkbp:relatedTo |
gptkb:Gödel's_incompleteness_theorems
gptkb:Rice's_theorem fixed-point combinator |
| gptkbp:sentence |
For any computable function, there exists an index e such that the function computed by e is the same as the function computed by applying the computable function to e.
|
| gptkbp:statedIn |
1938
|
| gptkbp:usedIn |
proofs of self-replicating programs
proofs of undecidability |
| gptkbp:bfsParent |
gptkb:Stephen_Kleene
|
| gptkbp:bfsLayer |
5
|