Hubbry Logo
search
logo

ALL (complexity)

logo
Community Hub0 Subscribers
Write something...
Be the first to start a discussion here.
Be the first to start a discussion here.
See all
ALL (complexity)

In computability and complexity theory, ALL is the class of all decision problems.

ALL contains all of the complex classes of decision problems, including RE and co-RE, and uncountably many languages that are neither RE nor co-RE. It is the largest complexity class, containing all other complexity classes.

See all
User Avatar
No comments yet.