3 articles
Index set (recursion theory)
An index set in recursion theory is a set of program indices whose membership depends only on the set a program recognizes, not on the program text.
Numbering (computability theory)
A numbering in computability theory is a surjective map from the natural numbers onto a countable collection of objects, such as the partial computable functions or the computably enumerable sets.
Rice's theorem
Rice's theorem, also called the Rice–Myhill–Shapiro theorem, states in computability theory that every nontrivial semantic property of programs is undecidable, proved by Henry Gordon Rice in 1953.