4 ms·
>Pure functions exist under Plato's Theory of the Form conception of the world, but not on a fixed and finite physical computer In the same vein you can say th
by wongarsu 10y ago
>Pure functions exist under Plato's Theory of the Form conception of the world, but not on a fixed and finite physical computer
In the same vein you can say that C is a Turing complete language (i.e. you can use C to simulate a Turing machine), so there can be no complete implementation of C on a computer because no computer can simulate a Turing machine (since real computers are only state machines, which are inferior to Turing machines).
When talking about computer-science terms like "pure function" or "turing complete" things tend to stay a lot more sane if you just assume that even in the real world you will not run out of memory (just as a lot of programming stays more sane under that assumption).