Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01141070n
Noun Concept
PT
No term available
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:
recursion theory
computability
Relations
Sources
IS A
classe

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License