Index set (computability)
Classes of partial recursive functions / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Index set (recursion theory)?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computability theory, index sets describe classes of computable functions; specifically, they give all indices of functions in a certain class, according to a fixed Gödel numbering of partial computable functions.