ALL (complexity)
From Infogalactic: the planetary knowledge core
In computability and complexity theory, ALL is the class of all decision problems.
Relations to other classes
ALL contains all complexity classes of decision problems, including RE and co-RE.
