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: Oh, for actual elections, not random organizations?
gollark: Why do they need dedicated vote-counting people? Surely this can be done with a "calculator" or some similar technology?
gollark: I mostly do computer-related things for reasons.
gollark: ... sure?
gollark: okay.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.