numbering of partial recursive functions
C39235
concept
The numbering of partial recursive functions is a systematic assignment of natural numbers (indices) to all partial recursive functions such that each index effectively encodes a Turing-computable procedure defining that function.
Observed surface forms (2)
| Surface form | Occurrences |
|---|---|
| concept in arithmetic hierarchy theory | 1 |
| concept in recursion theory | 1 |
Instances (2)
| Instance | Via concept surface |
|---|---|
| Kleene numbering | — |
| Kleene hierarchy | concept in recursion theory |