Re:The 3n+1 problem
by waterhouse on Thursday October 25, 2012 @01:25PM
(#4698485)
It would be a stack overflow, except Racket does not stack overflow--it will grab more memory, make a bigger stack, and continue. Eventually your problem would be "out of memory".
[ Parent
| on HN ]
There are no comments on this comment yet.