ALL (complexity)

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.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.