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 Wilfried Sieg's work on 'mechanical procedures' shows that Turing's own structural analysis of computation admits formalization sufficient for proof-theoretic treatment.

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

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Formalization may impose proof-theoretic constraints absent from Turing's more general and intuitive structural analysis of computation itself.
      ?

      Think about whether this reason is strong or weak

    • 2.Sieg's mechanistic framework risks reducing computation's scope by privileging syntactic manipulability over semantic adequacy and physical realizability.
      ?

      Think about whether this reason is strong or weak

    • 3.The claim conflates sufficient formalizability with vindication of Turing's original analysis, overlooking gaps between formal systems and computational reality.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Sieg's work on mechanical procedures successfully translates Turing's informal descriptions into formal systems amenable to proof-theoretic analysis.
      ?

      Think about whether this reason is strong or weak

    • 2.Proof-theoretic formalization of computation provides foundational rigor that strengthens rather than distorts Turing's original conceptual framework.
      ?

      Think about whether this reason is strong or weak

    • 3.Turing machines admit natural formalization within proof theory via theories like arithmetic, demonstrating structural compatibility at core levels.
      ?

      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.