Mapping the StarMaze A tale of mathematical obsession: "Before I can explain my decades-long quest to map the starmaze I must acquaint you with a small puzzle...I have a habit of seeing everything (cities, organizations, computers, networks, brains) as a maze, so I named this puzzle the starmaze....The first problem I ran into was that there were a lot of rooms...I invented wacky names for each room...But something funny happened...In that instant I finally grasped that the starmaze was arranged on the edges of a nine-dimensional hypercube..."
posted by vacapinta
on Jun 4, 2006 -
38 comments

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