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 P = NP, then every problem in NP is solvable in polyno... — Carmelics
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→If P = NP, then determining whether a mathematical formula is derivable by a proof of feasible length could be checked by an efficient algorithm.

    If P = NP, then every problem in NP is solvable in polynomial time.

    Modality & PossibilityTruth & Knowledge
    ?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.

    Topics

    Modality & PossibilityTruth & Knowledge

    Connections

    1 topic

    Proof of definition segments2 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.
    If P = NP, then determining whether a mathematical formula is derivable by a pro...Therefore membership in n-PROVABILITY_T would be decidable in polynomial time.n-PROVABILITY_T ∈ NP.

    Similar

    If P = NP, then every problem in NP is solvable in polynomial time100%If any single NP-complete problem has a polynomial time algorithm, the...89%If any NP-complete problem has a polynomial time algorithm, then all p...88%Every problem in NP is polynomial-time reducible to any NP-complete pr...87%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    For in this case a demonstration that \(\phi \not\in n\text{-}\sc{PROVABILITY}_{\mathsf{T}}\) (for a sufficiently large \(n\) and a sufficiently powerful \(\mathsf{T}\)) would be sufficient to show that we have no hope of ever comprehending a proof of \(\phi\) even if one were to exist. But now note that since \(n\text{-}\sc{PROVABILITY}_{\mathsf{T}} \in \textbf{NP}\), if it so happened that \(\textbf{P} = \textbf{NP}\) then the task of determining whether a mathematical formula is derivable in

    Details

    Type
    premise
    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