In computability and complexity theory, ALL is the class of all decision problems.
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.
This theoretical computer science–related article is a stub.
You can help Wikipedia by expanding it.