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
    Home/Original/inverse
    See Original
    Inverse View

    It is not the case that Cobham and Edmonds' identification of polynomial time with feasibility has been contested by complexity theorists like Parberry and Levin, who note that O(n^100) algorithms are polynomial yet practically infeasible.

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

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Cobham-Edmonds thesis correctly identifies a robust complexity class; O(n^100) algorithms are vanishingly rare in practice.
      ?

      Think about whether this reason is strong or weak

    • 2.Without a clear mathematical criterion like polynomial time, 'feasibility' becomes subjective, context-dependent, and non-comparable.
      ?

      Think about whether this reason is strong or weak

    • 3.The threshold between feasible and infeasible must be defined formally; practical engineering concerns are separate from complexity theory.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Polynomial time is a mathematical abstraction that fails to capture practical runtime constraints that matter for real computing.
      ?

      Think about whether this reason is strong or weak

    • 2.Empirically, O(n^100) algorithms cannot solve problems of realistic size, making the P class theoretically broad but practically hollow.
      ?

      Think about whether this reason is strong or weak

    • 3.Feasibility requires algorithms whose runtime remains manageable across problem instances engineers actually encounter in practice.
      ?

      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.
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42