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
    Such statements are generally believed unlikely to be ind... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→P ≠ NP is unlikely to be independent of Peano Arithmetic or ZFC.

    Such statements are generally believed unlikely to be independent of strong theories like PA.

    SkepticismTruth & 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

    SkepticismTruth & Knowledge

    Connections

    1 topic

    Modality & Possibility1 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    P ≠ NP is expressible as an arithmetical statement of the form ∀x∃y ψ(x,y) with ...P ≠ NP is unlikely to be independent of Peano Arithmetic or ZFC.There is currently no reason to suspect P ≠ NP is more likely to be independent ...

    Similar

    It is believed that P ≠ NP is unlikely to be independent of strong the...94%P ≠ NP is unlikely to be independent of strong formal theories such as...88%Although its logical form cannot exclude independence from PA or ZFC, ...82%Scientists frequently work with theories they do not regard as literal...80%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    1 On the significance of \(\textbf{P} \neq \textbf{NP}\)? The appreciation of complexity theory outside of theoretical computer science is largely due to the notoriety of open questions such as 1–4. \) – has attracted the greatest attention. e. the Millennium Problems (Cook 2006). g. (Sipser 1992), (Fortnow 2009), and (Fortnow 2013). \) will prove to have far reaching practical and theoretical consequences outside of computer science. Perhaps the most significant of these revolves around the pos

    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