Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02458425n
Noun Named Entity
FR
PR
EN
PR is the complexity class of all primitive recursive functions—or, equivalently, the set of all formal languages that can be decided in time bounded by such a function. Wikipedia
English:
complexity
Relations
Sources
IS A
classe de complexité
HAS PART
ELEMENTARY
PART OF
R
Wikidata
FR
PR

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