4 ms·
which effectively means it has infinite memory, does it not?
by asddubs 4y ago
which effectively means it has infinite memory, does it not?
- ezfe 4y agoI don't see a distinction myself between unbounded and infinite, but the Typing system might be unbounded but it's being run on a computer with bounded memory so it becomes bounded. But that isn't a property of the Typing system, it's a property of the environment it's being executed in.
- tripa 4y agoInfinite memory available, but never used.
- kps 4y agoWhen you look at the space complexity of an algorithm, it's never ‘infinity’.
- zbentley 4y agoNonsense, here's an implementation (in shell, so you can easily paste and run it in your terminal) of such an algorithm: :(){ :|:& };: It's a ... uh ... a recursive parallel processing algorithm. Yeah.
- contravariant 4y agoUnless you allow unbounded input there is technically a limit to the amount of memory an N-state Turing machine could possibly allocate (and still halt).