skip to main content
5 posts tagged with Mathematics and encyclopedia. (View popular tags)
Displaying 1 through 5 of 5. 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
on Apr 15, 2002 -
9 comments
Page:
1