Jump to content

ALL (complexity)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LaundryPizza03 (talk | contribs) at 03:26, 30 April 2024 (added Category:Computability theory using HotCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.


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=1221469830"