Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:class_of_computable_functions
|
| gptkbp:alsoKnownAs |
general recursive functions
mu-recursive functions |
| gptkbp:characterizedBy |
partial computable functions
|
| gptkbp:definedIn |
gptkb:musical_composition
primitive recursion minimization (μ-operator) |
| gptkbp:domain |
natural numbers
|
| gptkbp:equivalentTo |
Turing computable functions
lambda computable functions |
| gptkbp:field |
gptkb:logic
computability theory |
| gptkbp:includes |
primitive recursive functions
partial recursive functions |
| gptkbp:introduced |
gptkb:Thoralf_Skolem
gptkb:Rózsa_Péter |
| gptkbp:introducedIn |
1930s
|
| gptkbp:notation |
μ(n) for minimization operator
|
| gptkbp:property |
can be partial or total
basis for formalizing algorithmic computability defined by closure under certain operations |
| gptkbp:range |
natural numbers
|
| gptkbp:relatedTo |
gptkb:lambda_calculus
Turing machines primitive recursive functions partial recursive functions |
| gptkbp:usedIn |
gptkb:theoretical_computer_science
gptkb:Church–Turing_thesis proof theory |
| gptkbp:bfsParent |
gptkb:General_Recursive_Functions_of_Natural_Numbers
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
μ-recursive functions
|