3 ms·
> We don't know of anything that is provably not computation. How about the halting problem? :)
by Ologn 4y ago
> We don't know of anything that is provably not computation.
How about the halting problem? :)
- joenathanone 4y agoOr dividing by zero
- l33t2328 4y agoIf you show me a TM with an infinite length memory tape I’ll accept that.
- mr_toad 4y agoIs there a physical system that solves the halting problem?
- __MatrixMan__ 4y agoPresumably you mean the halting problem for Turing Machines? It's undecidable for other Turing machines, but that doesn't mean it's undecidable for all machines.
- 0xBABAD00C 4y ago> "yet it is implemented in the universe"
- nl 4y agoThe existence of uncomputable problems does not mean the things we know are not from computation.
- epgui 4y agoI would submit that a computation that never completes is probably still a computation.