Hacker News new | ask | show | jobs
by Retric 3776 days ago
That's not a valid game state. It's like saying chess is Touring complete when played on an infinite board.
1 comments

By this argument, x84_64 assembly isn't Turing complete because it needs finite memory...

Which is technically correct, just not very useful.

My Philosophy of Computer Science professor argued that you could prove anything was Turing complete, by suitably "gerrymandering the inputs" of your definition.

What that actually means, I'm not sure. I know how gerrymandered congress is, and they couldn't possibly get enough work done to be Turing complete.