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 SAT is NP-complete

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

    Reasons Against

    3 perspectives
    Reason against 1 of 3
    ?
    • 1.FACTORIZATION is in NP
      ?

      Think about whether this reason is strong or weak

    • 2.Every problem X in NP can be reduced in polynomial time to SAT by encoding the computation of the accepting nondeterministic Turing machine for X as a propositional formula
      ?

      Think about whether this reason is strong or weak

    • 3.SAT is therefore NP-hard
      ?

      Think about whether this reason is strong or weak

    Reason against 2 of 3
    ?
    • 1.FACTORIZATION is in NP
      ?

      Think about whether this reason is strong or weak

    • 2.Every problem X in NP is polynomial-time reducible to SAT
      ?

      Think about whether this reason is strong or weak

    • 3.For any NP machine N and input x, a propositional formula φ_{N,x} can be constructed such that φ_{N,x} is satisfiable if and only if N accepts x within p(n) steps
      ?

      Think about whether this reason is strong or weak

    Reason against 3 of 3
    ?
    • 1.FACTORIZATION is in NP
      ?

      Think about whether this reason is strong or weak

    • 2.Every problem X in NP is polynomial-time reducible to SAT via a reduction through the computation history of the non-deterministic Turing machine accepting X
      ?

      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.