Categories
  • Complexity classes
  • Undecidable problems
    •   Encyclosphere.org ENCYCLOREADER
      supported by EncyclosphereKSF

    ALL (complexity)

    From Wikipedia - Reading time: 3 min

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

    Relations to other classes

    [edit]

    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.

    [edit]


    P ≟ NP 

    This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

    • v
    • t
    • e
    This article is licensed under CC BY-SA 3.0.
    Original source: https://en.wikipedia.org/wiki/ALL (complexity)
    Status: article is cached
    Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF