Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:14944176n
Noun Concept
Categories: Theory of computation, Computability theory
EN
admissible numbering  Acceptable numbering  Acceptable programming system  Programming system  Roger's equivalence theorem
EN
In computability theory, admissible numberings are enumerations of the set of partial computable functions that can be converted to and from the standard numbering. Wikipedia
Definitions
Sources
EN
In computability theory, admissible numberings are enumerations of the set of partial computable functions that can be converted to and from the standard numbering. Wikipedia
Wikipedia
EN
admissible numbering
Wikidata
EN
Admissible numbering
Wikipedia Redirections
EN
Acceptable numbering, Acceptable programming system, Programming system, Roger's equivalence theorem, Rogers' equivalence theorem, Rogers equivalence theorem

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