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
    Deutsch and Penrose both argue quantum computation's theo... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→A proof that P is strictly contained in BQP would not alone determine the bearing of quantum computation on the limits of feasible computation or on the Cobham-Edmonds thesis

    Deutsch and Penrose both argue quantum computation's theoretical model is itself a physical thesis about what nature permits, not merely mathematical.

    ?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.Quantum computers exploit superposition and entanglement, which are physical phenomena, not abstract mathematical constructs.
      ?

      Think about whether this reason is strong or weak

    • 2.The Church-Turing thesis is a mathematical claim about computability; quantum computation's advantage requires physical realizability constraints.
      ?

      Think about whether this reason is strong or weak

    • 3.Deutsch's many-worlds interpretation explicitly grounds quantum computation in physical branch structure, not mere mathematical formalism.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.All computation models (Turing machines, lambda calculus, circuits) are ultimately abstract formalisms independent of physical substrate.
      ?

      Think about whether this reason is strong or weak

    • 2.Quantum computation's theoretical model can be formulated in purely mathematical terms without reference to physical realizability.
      ?

      Think about whether this reason is strong or weak

    • 3.Calling a model a 'physical thesis' conflates what nature *permits* with claims about computational complexity or algorithmic power.
      ?

      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

    Modality & Possibility1 linkedSkepticism1 linked

    Related

    A proof that P is strictly contained in BQP would not alone determine the bearin...All computation models (Turing machines, lambda calculus, circuits) are ultimate...Calling a model a 'physical thesis' conflates what nature *permits* with claims ...Deutsch's many-worlds interpretation explicitly grounds quantum computation in p...
    +3 moreShow less
    Quantum computation's theoretical model can be formulated in purely mathematical...Quantum computers exploit superposition and entanglement, which are physical phe...The Church-Turing thesis is a mathematical claim about computability; quantum co...

    Details

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