Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
parameterization theorem
|
| gptkbp:appliesTo |
partial recursive functions
|
| gptkbp:describes |
existence of computable functions for parameterization
|
| gptkbp:field |
computability theory
|
| gptkbp:implies |
program specialization is computable
|
| gptkbp:namedAfter |
gptkb:Stephen_Cole_Kleene
|
| gptkbp:publishedIn |
gptkb:Duke_Mathematical_Journal
|
| gptkbp:relatedTo |
gptkb:Gödel_numbering
gptkb:recursion_theorem computable functions |
| gptkbp:statedIn |
Recursion theory
|
| gptkbp:symbol |
s-m-n
|
| gptkbp:usedIn |
proof of Rice's theorem
proof of recursion theorem |
| gptkbp:yearProposed |
1943
|
| gptkbp:bfsParent |
gptkb:Kleene's_T_predicate
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kleene's s-m-n theorem
|