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
    A proof that P ≠ NP would validate existing inductive evi... — Carmelics
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Connected to 2 discussions

    Supports→A proof that P ≠ NP would provide evidence that the Cobham-Edmonds Thesis correctly analyzes the pre-theoretical notion of feasibility.
    Supports→A proof that P ≠ NP would validate the Cobham-Edmonds Thesis as a correct analysis of the pre-theoretical notion of feasibility

    A proof that P ≠ NP would validate existing inductive evidence for P ≠ NP

    All sources support itTruth & 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

    Truth & KnowledgeAll sources support it

    Connections

    2 topics

    Proof of definition segments3 linked

    Next step

    Based on where you are in your exploration

    Browse more in Truth & Knowledge
    Related propositions within the same area of thought.
    Modality & Possibility
    3 linked

    Related

    A proof that P ≠ NP would provide evidence that the Cobham-Edmonds Thesis correc...A proof that P ≠ NP would validate the Cobham-Edmonds Thesis as a correct analys...Confirming P ≠ NP would allow us to unconditionally assert that NP-hard problems...Heuristic considerations also point to the non-coincidence of NP and coNP, and o...
    +2 moreShow less
    Such a proof would allow us to unconditionally assert that NP-hard problems are ...The Cobham-Edmonds Thesis identifies feasible computation with polynomial-time c...

    Similar

    A proof that P ≠ NP would validate existing inductive evidence for P ≠...99%Convergent inductive evidence supports P ≠ NP86%A proof that P ≠ NP would validate existing inductive evidence for the...86%There is convergent inductive evidence supporting P ≠ NP80%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    But in a letter to von Neumann, Gödel (1956) observed that if we were able to efficiently decide \(n\text{-}\sc{PROVABILITY}_{\mathsf{T}}\), then this would already have enormous significance for mathematical practice. For note that it seems plausible to assume that no human mathematician will ever be able to comprehend a proof containing 100 million symbols (\(\approx 25000\) pages). If we were able to efficiently check if \(\phi \in n\text{-}\sc{PROVABILITY}_{\mathsf{T}}\) (say for \(n = 10^8\

    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