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
    The polynomial simulation bound (O(t(n)^3)) is not practi... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The RAM machine model does not provide an asymptotically superior model of feasible computation compared to the Turing machine model.

    The polynomial simulation bound (O(t(n)^3)) is not practically negligible: a cubic overhead can transform tractable problems into intractable ones for real inputs.

    ?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.Real cryptographic systems (RSA-2048) with cubic overhead become computationally infeasible within human timescales, contradicting theoretical tractability.
      ?

      Think about whether this reason is strong or weak

    • 2.Hidden constants in O(t(n)³) vary drastically by implementation; worst-case constants can multiply runtime by 10⁶+, rendering asymptotic analysis misleading.
      ?

      Think about whether this reason is strong or weak

    • 3.Practical problem instances (n=10⁶) show cubic blowup effects matching polynomial simulation bounds, empirically validating the intractability concern.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Polynomial overhead is fundamentally different from exponential blowup; O(n³) remains computable in milliseconds for realistic input sizes in most domains.
      ?

      Think about whether this reason is strong or weak

    • 2.Modern hardware advances (parallelization, GPUs) systematically reduce constant factors, making theoretical cubic bounds irrelevant to actual performance.
      ?

      Think about whether this reason is strong or weak

    • 3.Practical intractability depends on absolute runtime thresholds, not asymptotic classes; many cubic-overhead problems solve acceptably within real constraints.
      ?

      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 linkedModality & Possibility1 linked

    Related

    Hidden constants in O(t(n)³) vary drastically by implementation; worst-case cons...Modern hardware advances (parallelization, GPUs) systematically reduce constant ...Polynomial overhead is fundamentally different from exponential blowup; O(n³) re...Practical intractability depends on absolute runtime thresholds, not asymptotic ...
    +3 moreShow less
    Practical problem instances (n=10⁶) show cubic blowup effects matching polynomia...Real cryptographic systems (RSA-2048) with cubic overhead become computationally...The RAM machine model does not provide an asymptotically superior model of feasi...

    Details

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