These were great articles written by Peteris Krumins. I would have never thought that sed would be a turning complete language but it kinda makes sense now. Also check out his post on the busy beaver problem. His scripts are pretty fun to run.
A proof that Unix utility “sed” is Turing complete
The Busy Beaver Problem