sed is provably Turing complete: http://www.catonmat.net/blog/proof-that-sed-is-turing-complete/ http://www.catonmat.net/blog/proof-that-sed-is-turing-comple...

sed is provably Turing complete: http://www.catonmat.net/blog/proof-that-sed-is-turing-complete/ http://www.catonmat.net/blog/proof-that-sed-is-turing-comple... which means that it's effectively able to simulate any other Turing-complete language (provided enough processing power and memory).