Daniel Fischer wrote:
Am Sonntag, 6. Januar 2008 15:54 schrieb Achim Schneider:
That's an interesting task: Design a non-touring complete,
restricted language in which every expression is decidable, without
making the language unusable for usual programming problems.
I'm not a logician, but didn't Gödel prove that you couldn't express the
(full) arithmetic of natural numbers in such a language?
What if you restricted yourself to the arithmetic of natural numbers
modulo 2^64?
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
