ALL (complexity)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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

Relations to other classes[edit]

ALL contains all complexity classes of decision problems, including RE and co-RE.

External links[edit]