- cross-posted to:
- programming@lemmygrad.ml
- cross-posted to:
- programming@lemmygrad.ml
A refutation of Cantor’s idealist diagonal argument using Turing’s materialist theory of computation.
A refutation of Cantor’s idealist diagonal argument using Turing’s materialist theory of computation.
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.