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: Also, I now have a stupidly large naming backlog: any ideas?
gollark: Meanwhile, the prizes in market thread continues.
gollark: Ah, those crazy PB prizes.
gollark: What are they putting up there?
gollark: It is written, "the pen is mightiest when it writes orders for swords".
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.