Index set (computability)

In the field of recursion theory, index sets describe classes of partial recursive functions, specifically they give all indices of functions in that class according to fixed enumeration of partial recursive functions (a Gödel_numbering).

Definition

Fix an enumeration of all partial recursive functions, or equivalently of recursively enumerable sets whereby the eth such set is $W_{e}$ and the eth such function (whose domain is $W_{e}$) is $\phi _{e}$.

Let ${\mathcal {A}}$ be a class of partial recursive functions. If $A=\{x:\phi _{x}\in {\mathcal {A}}\}$ then $A$ is the index set of ${\mathcal {A}}$.

Index sets and Rice's theorem

Most index sets are incomputable (non-recursive) aside from two trivial exceptions. This is stated in Rice's theorem:

Let ${\mathcal {C}}$ be a class of partial recursive functions with index set $C$. Then $C$ is recursive if and only if $C$ is empty, or $C$ is all of $\omega$.

where $\omega$ is the set of natural numbers, including zero.

Rice's theorem says "any nontrivial property of partial recursive functions is undecidable"

References

• Odifreddi, P. G. (1992). Classical Recursion Theory, Volume 1. Elsevier. p. 668. ISBN 0-444-89483-7.
• Rogers Jr., Hartley (1987). Theory of Recursive Functions and Effective Computability. MIT Press. p. 482. ISBN 0-262-68052-1.