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 claim grounded in the absence of discovered polynomial ... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Practical computability correlates with the existence of polynomial time algorithms.

    A claim grounded in the absence of discovered polynomial algorithms conflates the sociology of mathematical discovery with structural facts about computational complexity.

    ?Rate how convincing each reason is below to see the overall strength.
    1 reason for
    1 reason against

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Historical absence of algorithms reflects researcher effort and funding priorities, not inherent mathematical impossibility of solutions.
      ?

      Think about whether this reason is strong or weak

    • 2.P vs NP remains unsolved; lack of polynomial algorithms may indicate unsolved problems rather than proven lower bounds.
      ?

      Think about whether this reason is strong or weak

    • 3.Structural complexity requires formal proofs (like time hierarchy theorems), not mere failure to find efficient algorithms.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Empirical patterns across decades and thousands of researchers studying NP problems provide genuine evidence about complexity structure.
      ?

      Think about whether this reason is strong or weak

    • 2.The distinction between 'not found yet' and 'structurally impossible' is itself epistemologically unclear without independent proof.
      ?

      Think about whether this reason is strong or weak

    • 3.Rigorous conditional results (like NP-completeness reductions) derive from structural properties, not mere discovery sociology.
      ?

      Think about whether this reason is strong or weak

    Sign in or register to share your perspective on this statement.

    Next step

    Based on where you are in your exploration

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

    Connections

    2 topics

    Truth & Knowledge1 linkedSkepticism1 linked

    Related

    Empirical patterns across decades and thousands of researchers studying NP probl...Historical absence of algorithms reflects researcher effort and funding prioriti...P vs NP remains unsolved; lack of polynomial algorithms may indicate unsolved pr...Practical computability correlates with the existence of polynomial time algorit...
    +3 moreShow less
    Rigorous conditional results (like NP-completeness reductions) derive from struc...Structural complexity requires formal proofs (like time hierarchy theorems), not...The distinction between 'not found yet' and 'structurally impossible' is itself ...

    Details

    Type
    claim
    Perspectives
    2 (1 for, 1 against)
    Edits
    1 edit