Jump to content

ALL (complexity)

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Rectech enthusiast (talk | contribs) at 18:27, 25 July 2024 (just a minor sentence addition). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computability and complexity theory, ALL is the class of all decision problems.

Relations to other classes

[edit]

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.

[edit]


P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=ALL_(complexity)&oldid=1236628022"