Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
A proof that Unix utility sed is Turing complete (catonmat.net)
2 points by pabs3 on Feb 23, 2024 | 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.




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

Search: