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.
All labels observed (3)
| Label | Occurrences |
|---|---|
| concept in arithmetic hierarchy theory | 1 |
| concept in recursion theory | 1 |
| numbering of partial recursive functions canonical | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: numbering of partial recursive functions
Generated description
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.
Instances (2)
| Instance | Via concept surface |
|---|---|
| Kleene numbering | — |
| Kleene hierarchy | concept in recursion theory |