Kleene's normal form theorem
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
partial recursive functions
total recursive functions |
| gptkbp:describes |
representation of computable functions
|
| gptkbp:field |
gptkb:logic
recursion theory |
| gptkbp:hasComponent |
gptkb:μ-operator
primitive recursive predicate |
| gptkbp:namedAfter |
gptkb:Stephen_Cole_Kleene
|
| gptkbp:publishedIn |
1936
|
| gptkbp:relatedTo |
gptkb:Church–Turing_thesis
gptkb:Technical_Machine gptkb:μ-recursive_functions primitive recursive functions |
| gptkbp:state |
every computable function can be written using primitive recursive functions and the μ-operator
|
| gptkbp:bfsParent |
gptkb:Kleene's_T_predicate
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kleene's normal form theorem
|