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.
References
ALL (complexity) Wikipedia(Text) CC BY-SA
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.