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
    Home/Original/inverse
    See Original
    Inverse View

    It is not the case that The availability of logic-based (machine-independent) characterizations of complexity classes like NP provides additional evidence for the mathematical robustness of those classes.

    ?Set your confidence on the premises below to see your aggregate.

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.A logic captures a complexity class when every problem in that class is definable by a formula of that logic over finite structures.
      ?

      Think about whether this reason is strong or weak

    • 2.NP is captured by second-order existential logic (SO∃), a characterization that makes no reference to a specific model of computation such as a Turing machine.
      ?

      Think about whether this reason is strong or weak

    • 3.Machine-independent characterizations demonstrate that the class's identity does not depend on the particulars of any computational model.
      ?

      Think about whether this reason is strong or weak

    Next step

    Based on where you are in your exploration

    Strongest counterpoint
    Explore the most compelling reason on the other side.