GUIDO VAN ROBOT

Haskell fans are funny. They pride themselves that Haskell has no while-loops -- but they have infinite lists. They tell you to define everything using recursive functions, but then warn you that it will take O(N) stack space unless you rewrite it using foldl or seq. I guess nobody's perfect. :-)

Surely Haskell, C and Python are all Turing complete?

but then warn you that it will take O(N) stack space unless you rewrite it using foldl or seq