Comment on Lisp implementation in sedparentComments−rmorell12ysed is provably 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).−bnegreve12ysed is provably Turing completeThis submission is in itself, an elegant proof that sed is Turing complete.
Comments
sed is provably 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).
This submission is in itself, an elegant proof that sed is Turing complete.