Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02458196n
Noun Named Entity
Categories: Undecidable problems, Complexity classes
EN
RE
EN
In computability theory and computational complexity theory, RE is the class of decision problems for which a 'yes' answer can be verified by a Turing machine in a finite amount of time. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
In computability theory and computational complexity theory, RE is the class of decision problems for which a 'yes' answer can be verified by a Turing machine in a finite amount of time. Wikipedia
A complexity class of decision problems Wikipedia Disambiguation
Complexity class Wikidata
IS A
complexity class
computational problem
HAS PART
R
RE-complete
PART OF
ALL
Wikipedia
EN
RE (complexity)
Wikidata
EN
RE
Wikipedia Redirections
EN
co-RE, Co-RE-complete, NRNC, RE-complete, semi-algorithm, Semialgorithm

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