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 argument structure equivocates between 'simulation' as logical reduction and 'simulation' as physical realizability, a distinction Turing himself acknowledged in his 1950 distinction between discrete and continuous machines.

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

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Turing's discrete/continuous distinction addressed machine design, not the logical vs. physical simulation distinction being claimed here.
      ?

      Think about whether this reason is strong or weak

    • 2.Modern computability theory treats physical realizability as orthogonal to logical function—the distinction doesn't require separate equivocation.
      ?

      Think about whether this reason is strong or weak

    • 3.Most arguments about simulation (e.g., in AI) explicitly operate within logical/abstract space without conflating physical substrate questions.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Turing's 1950 paper explicitly distinguishes discrete-state machines from continuous systems, acknowledging different computational properties.
      ?

      Think about whether this reason is strong or weak

    • 2.Logical simulation (algorithmic equivalence) differs from physical simulation (substrate implementation) in what counts as success.
      ?

      Think about whether this reason is strong or weak

    • 3.Equivocating between these senses allows arguments to slip from 'computable' to 'physically realizable' without justification.
      ?

      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.