4 ms·
> It is actually possible to create output with sed that results in executable bytecode similar to C. The executable bytecode for Word is a constant. cat can o
by daveFNbuck 8y ago
> It is actually possible to create output with sed that results in executable bytecode similar to C.
The executable bytecode for Word is a constant. cat can output that.
> Word itself is turing complete
Word on a physical computer doesn't have access to an infinite tape. It can only reach a finite number of states, so you can simulate Word as run on a physical machine using a finite state machine with perfect fidelity.
- c22 8y agoNothing on a physical anything has access to an infinite tape. So nothing is a turing machine and the phrase is meaningless?
- saagarjha 8y agoTechnically, yes.
- daveFNbuck 8y agoIt's a model. The phrase is meaningful as far as its features correspond well to features of the thing you're trying to model. Turing machines are pretty good models for which functions are computable on something like a model computer. They're not good models for interactive graphical applications.