On 09/11/2010 05:41 PM, nemesis wrote:
> guess that's a far more math-geared language than haskell... ;)
For suitable definition of "math-geared".
Apparently a suitable system of Diophantine equations is
Turing-complete. (See Hilbert's tenth problem.)
Many other innocuous-looking things are Turing-complete as well.
Cellular automata and term-rewrite systems immediately spring to mind.
