A refutation of Cantor’s idealist diagonal argument using Turing’s materialist theory of computation.

  • Llituro [he/him, they/them]@hexbear.netM
    link
    fedilink
    English
    arrow-up
    2
    ·
    10 months ago

    Also, this seems obvious, but a Turing complete machine doesn’t have to have programs that halt, so clearly Turing was alright with reasoning about things that couldn’t be concretely computed outright to completion.