Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    If computational complexity classes are model-relative ra... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→At least one of the inclusions L ⊆ NL, NL ⊆ P, P ⊆ NP, NP ⊆ PSPACE must be proper

    If computational complexity classes are model-relative rather than model-invariant, the 'proper containment' of L in PSPACE may reflect artifact of the Turing formalism rather than an absolute mathematical fact.

    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Key Terms

    Computational complexity classes(as used in computer science and mathematical logic)
    Categories that organize computer problems based on how much time or resources a computer needs to solve them; think of them like difficulty ratings for math problems.
    L (complexity class)(computer science/complexity theory)
    A category of computational problems that can be solved by a computer using a very small amount of memory, similar to how some tasks need less mental effort than others.
    Model-invariant(as used in logic and mathematics)
    Something that stays the same and true no matter which system or framework you use to think about it.
    PSPACE(Introduced as a class between NP/coNP and EXP that captures problems requiring unbounded time but polynomial space.)
    The complexity class of problems decidable using a feasible (polynomial) amount of memory space, regardless of time; likely properly contained in EXP but containing many apparently infeasible problems.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Proper containment(as used in mathematics and set theory)
    When one group is completely inside another group, but they're not the same size—like how all squares are rectangles, but not all rectangles are squares.
    Turing formalism(as used in computer science and mathematical logic)
    The basic mathematical rules and symbols that computer scientist Alan Turing created to precisely define what 'computation' and 'solving a problem' actually mean.
    artifact(Contrasted with real cellular structures in evaluating microscopy results)
    A feature in a micrograph produced by the methods of preparation rather than by actual structures in the cell
    model-relative(describing properties in logic and mathematics)
    Dependent on which particular version or interpretation of a system you're looking at; something can be true in one model but not in another.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    At least one of the inclusions L ⊆ NL, NL ⊆ P, P ⊆ NP, NP ⊆ PSPACE must be prope...

    Details

    Type
    claim
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective