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
    Wilfried Sieg's work on 'mechanical procedures' shows tha... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Turing's thesis is not susceptible to mathematical proof

    Wilfried Sieg's work on 'mechanical procedures' shows that Turing's own structural analysis of computation admits formalization sufficient for proof-theoretic treatment.

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

    Reasons Against

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

    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

    Truth & Knowledge1 linkedSkepticism1 linked

    Related

    Formalization may impose proof-theoretic constraints absent from Turing's more g...Proof-theoretic formalization of computation provides foundational rigor that st...Sieg's mechanistic framework risks reducing computation's scope by privileging s...Sieg's work on mechanical procedures successfully translates Turing's informal d...
    +3 moreShow less
    The claim conflates sufficient formalizability with vindication of Turing's orig...Turing machines admit natural formalization within proof theory via theories lik...Turing's thesis is not susceptible to mathematical proof

    Details

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