loading...

re: Explain Pure Functions Like I'm Five VIEW POST

TOP OF THREAD FULL DISCUSSION
re: True. Thats why though Haskell is often considered the "most functional" out of others, but not Purely functional, because the type system allows f...

That claim is as meaningful as the claim that no computer is Turing complete because they all have finite memory.

They are if you ignore any resource limitations and thats the point really. A Turing machine is more of a mathematical model than a real world implementation as you cannot possibly express the notion of infinity in computer systems. There has to be an upper limit somewhere.

code of conduct - report abuse