News for hackers. Stuff that matters.
Re:The 3n+1 problem by lmm on Thursday October 25, 2012 @01:05PM (#4698394)
The function doesn't look to be tail-recursive, so my guess would be a stack overflow.

Of course, if you run it and get a stack overflow, you have no way of knowing whether the number was really a counterexample or just one that took many steps to reach 1.

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".
Re:The 3n+1 problem by masterzora on Thursday October 25, 2012 @02:09PM (#4698719)
Of course, though it does mean you should examine it further to check.