4 ms·
Any machine which is Turing complete is Tetris-complete and all the other -complete you list. At the end, all of it is just binary values somewhere and trapping
by WastingMyTime89 3y ago
Any machine which is Turing complete is Tetris-complete and all the other -complete you list. At the end, all of it is just binary values somewhere and trapping instructions which you can perfectly run on anything Turing-complete.
- zokier 3y ago"receive keyboard events" or "draw pixels on screen" are not properties that arbitrary turing machine has. So it is meaningful to distinguish systems that have those properties (and/or others) from systems that do not. Paradoxically computation is actually just small part of what computers do.
- systoll 3y agoTuring initially distinguishes between ‘automatic machines’ which do not receive input, and ‘choice machines’, which do. It then describes the latter in terms of the former. It only talks about binary choices, but keyboards are just methods for sending a few of those at once. If you don’t abstract away that kind of stuff, it’s not obvious why you’re doing any generalisation at all. Tetris.app on my phone cannot read from a game boy cartridge, or speak to a joystick or arcade cabinet CRT screen - is it Tetris complete?
- JohnFen 3y ago"receive keyboard events" or "draw pixels on screen" are higher-level actions that are the result of the same computations that are used for everything else.