Hacker News new | past | comments | ask | show | jobs | submit login
A proof that Unix utility sed is Turing complete (catonmat.net)
2 points by pabs3 11 months ago | hide | past | favorite | 1 comment



Writing 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.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: