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

    It is not the case that The complexity class P describes the class of feasibly decidable problems

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

    Reasons For

    2 perspectives
    Reason for 1 of 2
    ?
    • 1.Problems solvable in O(n^1000000) time are technically in P but are computationally infeasible for any realistic input size.
      ?

      Think about whether this reason is strong or weak

    • 2.The Cobham-Edmonds Thesis conflates mathematical tractability with physical feasibility by ignoring the magnitude of polynomial constants and exponents.
      ?

      Think about whether this reason is strong or weak

    • 3.Feasibility is an empirical and resource-relative notion that cannot be captured by any single complexity class defined purely by asymptotic growth.
      ?

      Think about whether this reason is strong or weak

    Reason for 2 of 2
    ?
    • 1.The identification of P with feasibility is model-dependent, yet Turing machines do not accurately represent the parallel or quantum computational architectures available in practice.
      ?

      Think about whether this reason is strong or weak

    • 2.Parberry (1986) and others have argued that the Church-Turing Thesis does not entail that polynomial time on a Turing machine tracks feasibility across all physically realizable computation models.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.The Cobham-Edmonds Thesis identifies feasible decidability with polynomial-time decidability
      ?

      Think about whether this reason is strong or weak

    • 2.The class P is defined relative to the deterministic Turing machine model, which is assumed to be a reasonable model of computation
      ?

      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.