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
    If physically instantiated analog processes exceed Turing... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

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

    If physically instantiated analog processes exceed Turing-machine expressibility, then 'most general' must be relativized to discrete symbol manipulation, not computation as such.

    ?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.Physical systems demonstrably exhibit continuous dynamics (e.g., fluid flow, quantum mechanics) that resist discrete symbolic encoding without lossy approximation.
      ?

      Think about whether this reason is strong or weak

    • 2.Turing-completeness defines a specific formal capability; calling it 'most general computation' conflates a technical property with metaphysical generality.
      ?

      Think about whether this reason is strong or weak

    • 3.If analog processes solve problems discrete systems cannot, restricting 'computation' to Turing-machines excludes genuine computational paradigms from the definition.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Any physically realizable analog computation must ultimately be measured/output discretely; this measurement boundary dissolves the analog-discrete distinction.
      ?

      Think about whether this reason is strong or weak

    • 2.No known analog system provably computes beyond Turing-expressibility; hypercomputation remains theoretical, so the premise's antecedent remains unestablished.
      ?

      Think about whether this reason is strong or weak

    • 3.Relativizing 'most general computation' to discrete manipulation is self-defeating—it abandons universality for definitional convenience rather than discovery.
      ?

      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

    Any physically realizable analog computation must ultimately be measured/output ...If analog processes solve problems discrete systems cannot, restricting 'computa...No known analog system provably computes beyond Turing-expressibility; hypercomp...Physical systems demonstrably exhibit continuous dynamics (e.g., fluid flow, qua...
    +3 moreShow less
    Relativizing 'most general computation' to discrete manipulation is self-defeati...The theory of Turing machines is the most general theory of computation possible...Turing-completeness defines a specific formal capability; calling it 'most gener...

    Details

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