Re:A proof that Unix utility sed is Turing complete
by cyborgx7 on Friday February 15, 2019 @05:34AM
(#19169839)
Here is the (overly) simple explanation: Something being Turing complete means that it can compute anything that can be computed.
[ Parent
| on HN ]