Jump to content

ALL (complexity)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 117.201.93.155 (talk) at 10:33, 23 August 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

'Error: Protected edit requests can only be made on the talk page.' 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.