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.
gollark: Well, obviously crazy madness will occasionally happen with enough prize handouts.
gollark: I'd put it at about 1 in several thousand at least.
gollark: Gusties?
gollark: Also, I'm now kicking myself for ignoring that release until it was too late.
gollark: Madness.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.