ALL (complexity)
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.
This is an old revision of this page, as edited by Ianushii (talk | contribs) at 23:01, 31 August 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
In computability and complexity theory, ALL is the class of all decision problems.
ALL contains all complexity classes of decision problems, including RE and co-RE.
| Considered feasible | |
|---|---|
| Suspected infeasible | |
| Considered infeasible | |
| Class hierarchies | |
| Families of classes | |