Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
waterhouse
on Oct 25, 2012
|
parent
|
context
|
favorite
| on:
The 3n+1 problem
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".
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: