General Recursive Functions of Natural Numbers
GPTKB entity
Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
partial recursive functions
|
| gptkbp:characterizedBy |
recursion
minimization operator primitive recursion |
| gptkbp:definedIn |
natural numbers
|
| gptkbp:example |
gptkb:Ackermann_function
addition multiplication factorial function |
| gptkbp:field |
gptkb:logic
computability theory theoretical computer science |
| gptkbp:formedBy |
gptkb:μ-recursive_functions
gptkb:Kleene's_T_predicate |
| gptkbp:hasProperty |
can be partial or total
effectively calculable |
| gptkbp:hasSubgroup |
primitive recursive functions
partial functions |
| https://www.w3.org/2000/01/rdf-schema#label |
General Recursive Functions of Natural Numbers
|
| gptkbp:introduced |
gptkb:Kurt_Gödel
gptkb:Stephen_Kleene |
| gptkbp:relatedTo |
gptkb:lambda_calculus
gptkb:Church-Turing_thesis Turing computable functions |
| gptkbp:usedIn |
defining computability
defining recursive enumerability |
| gptkbp:bfsParent |
gptkb:Stephen_Kleene
|
| gptkbp:bfsLayer |
5
|