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 argument structure equivocates between 'simulation' a... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→NTIME(f(n)) is a subset of SPACE(f(n))

    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.

    ?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.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

    Reasons Against

    1 perspective
    Reason against
    ?
    • 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

    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.

    Key Terms

    Alan Turing(the philosopher/scientist being referenced)
    A British mathematician who pioneered computer science and artificial intelligence; he's famous for asking whether machines can think.
    Continuous machines(Turing's 1950 distinction between types of machines)
    Machines that work with smooth, flowing changes rather than separate steps (like analog devices that gradually increase or decrease).
    Discrete machines(Turing's 1950 distinction between types of machines)
    Machines that work with separate, distinct steps or values (like computers that use 1s and 0s), rather than continuous flowing changes.
    Equivocates(describes a flaw in the argument being discussed)
    Uses the same word in two different ways to make an argument seem stronger than it actually is, which is a logical trick.
    Logical reduction(one meaning of 'simulation' in the argument)
    Breaking down a complex problem into simpler logical pieces to see if something is theoretically possible.
    Physical realizability(the other meaning of 'simulation' in the argument)
    Whether something can actually be built or created in the real, physical world (not just in theory).
    knowledge(Distinguished from mere true belief, which may be the product of indoctrination and need not exercise deliberative capacities.)
    Justified true belief — true belief that has been arrived at through the exercise of deliberative capacities, including comparison of and deliberation among alternatives.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    Equivocating between these senses allows arguments to slip from 'computable' to ...Logical simulation (algorithmic equivalence) differs from physical simulation (s...

    Details

    Type
    claim
    Perspectives
    2 (1 for, 1 against)
    Edits
    1 edit
    Modern computability theory treats physical realizability as orthogonal to logic...
    Most arguments about simulation (e.g., in AI) explicitly operate within logical/...
    +3 moreShow less
    NTIME(f(n)) is a subset of SPACE(f(n))Turing's 1950 paper explicitly distinguishes discrete-state machines from contin...Turing's discrete/continuous distinction addressed machine design, not the logic...