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.
External links edit