3 ms·
> sed is provably Turing complete This submission is in itself, an elegant proof that sed is Turing complete.
by bnegreve 12y ago
> sed is provably Turing complete
This submission is in itself, an elegant proof that sed is Turing complete.
3 ms·