News for hackers. Stuff that matters.
Re:The Busy Beaver Problem by gwern on Friday October 30, 2009 @06:26PM (#912928)
Well, here's another approach. We can solve the halting problem for any finite TM (http://portal.acm.org/citation.cfm?id=1052796.1052798), so let's imagine we're looking at a possible BB, n. All we have to do is run all the possible programs, and see whether of the halting ones, one is bigger than n.

There are no comments on this comment yet.