ALL (complexity)
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computability and complexity theory, ALL is the class of all decision problems.
In computability and complexity theory, ALL is the class of all decision problems. ==Relations to other classes== ALL contains all of the complex classes of decision problems, including RE and co-RE, and uncountably many languages that are neither RE nor co-RE. It is the largest complexity class, containing all other complexity classes. ==External links==
Text derived from https://en.wikipedia.org/w/index.php?oldid=1236628022 under CC BY-SA 4.0; modifications have been made.