April 15, 2002
11:16 PM
Subscribe
Can you stump the Encyclopedia of Integer Sequences?Every identifiable sequence known to man, including:
Name: Busy Beaver problem: maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.
Comment: The sequence grows faster than any computable function of n, and so is non-computable.
Keywords: hard,huge,nice,nonn,bref
If your sequence does not appear there, you might want to try the
Super Seeker.
posted by vacapinta (9 comments total)
« Older
I just finished e-filing my taxes and I want to te...
| We only had you for the spare ...
Newer »
posted by juv3nal at 12:29 AM on April 16, 2002