2 ms·
A proof that Unix utility sed is Turing complete
- 082349872349872 3y agoWriting non-trivial programs in sed is a good exercise in (1) using largely unary representations, and (2) casting nearly all problems as an exercise in determining a suitable lookup table for state transitions until fixed point.