3 ms·
Practically realizable CPU’s are just deterministic finite state automata with a very large number of states.
by basementcat 8y ago
Practically realizable CPU’s are just deterministic finite state automata with a very large number of states.
- saagarjha 8y agoSure, but their states aren't quite what you'd consider to be states for an abstract Turing machine. There's a CPU state that also happens to set some pixels on a display to a certain value, for example.
- baddox 8y agoSo a display is simply a device you plug into some pins on the computer to format the computer’s state in a more human-friendly way. You could do the exact same thing with a Turing machine.
- saagarjha 8y agoYeah, but you don't with sed. Hence why it can't be used to run Microsoft Word.
- c22 8y agoWhy not? While sed is chuggng away at assembling your instructions you will have plenty of time to work on the problem. Just bulid a device that plugs into the serial port of your computer, run your sed-word amalgamation in a shell on the serial tty. Configure your device to interpret the ascii sequences from the serial terminal as pixels and output them as physical dots of light. Now for bonus points you can redesign the communication protocol to be more compact.