|
In computability theory Rogers' equivalence theorem characterizes the Gödel numberings, or effective numberings of the set of computable functions. The theorem is named after Hartley Rogers, Jr.
Equivalence theorem A numbering of the set of computable functions satisfies the smn theorem and the utm theorem if and only if it is equivalent to a Gödel numbering. | ||||||||
|
| |||||||||
 |
|
| |