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
    Analog computation models, as defended by Pour-El and Ric... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The theory of Turing machines is the most general theory of computation possible.

    Analog computation models, as defended by Pour-El and Richards, can compute real-valued functions over continuous domains that are Turing-uncomputable.

    ?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.Continuous physical systems evolve via differential equations whose solutions can encode uncomputable real numbers without discrete step limitations.
      ?

      Think about whether this reason is strong or weak

    • 2.Pour-El and Richards proved specific ODEs exist whose solutions are uncomputable, demonstrating that analog systems can exceed Turing limits in principle.
      ?

      Think about whether this reason is strong or weak

    • 3.Digital computation discretizes continuous domains, losing information; analog systems operating natively on reals avoid this inherent constraint.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Physical analog systems require infinite precision measurement and control; any practical implementation introduces errors making results effectively computable.
      ?

      Think about whether this reason is strong or weak

    • 2.Uncomputable solutions to ODEs don't constitute feasible computation—they require infinite time or unmeasurable initial conditions no system can provide.
      ?

      Think about whether this reason is strong or weak

    • 3.The Church-Turing thesis remains unrefuted; analog systems are ultimately physical implementations subject to same computational limits as digital ones.
      ?

      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

    No other argument is better1 linkedTruth & Knowledge1 linked

    Related

    Continuous physical systems evolve via differential equations whose solutions ca...Digital computation discretizes continuous domains, losing information; analog s...Physical analog systems require infinite precision measurement and control; any ...Pour-El and Richards proved specific ODEs exist whose solutions are uncomputable...
    +3 moreShow less
    The Church-Turing thesis remains unrefuted; analog systems are ultimately physic...The theory of Turing machines is the most general theory of computation possible...Uncomputable solutions to ODEs don't constitute feasible computation—they requir...

    Details

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