|
|
|
|
|
by MathMonkeyMan
1517 days ago
|
|
Let's be extra super pedantic. If (let x () (x)) is allowed to take more than a constant amount of space, then for any finite memory there is always some finite runtime after which the program will exhaust the memory. With proper tail calls, there is always some finite memory above which the program will not consume, even given an arbitrarily long runtime. So, while it is a problem of degrees, one degree is infinite while the other is finite. |
|