bn:01141070n
Noun Concept
Categories: Articles with short description, Computability theory
EN
index set
EN
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. Wikipedia
English:
computability
recursion theory
Definitions
Relations
Sources
EN
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. Wikipedia
Classes of partial recursive functions, specifically they give all indices of functions in that class according to a fixed enumeration of partial recursive functions Wikidata
IS A
Wikidata
Wikipedia Redirections