Re:Why do we need modules at all? (2011)
by nowne on Friday November 07, 2014 @04:49PM
(#8574820)
There are countably infinite number of functions. A simple proof is that each function can be represented as a string, and there are countably infinite number of strings for a finite alphabet. You could also argue that functions are equivalent to Turing machines, and there are a finite number of Turing machines.
[ Parent
| on HN ]
There are no comments on this comment yet.