Proving Aargh! Turing Complete
When people come up with a new programming language, particularly an esoteric one, there are two important questions:
- Can you write a Quine?
- Is it Turing complete?
For Argh!, the first question was quickly answered by someone posting a quine on a mailing list for esoteric languages (distributed with Argh! as examples/quine.agh). The Turing completeness proof took a bit longer.