Skip Montanaro <skip at mojam.com> writes: > A Turing Complete language is one that can compute anything that you > can compute with a simple Turing machine. A "simple" Turing machine has infinite memory. Who has that? :-) -- François Pinard http://www.iro.umontreal.ca/~pinard