Peteris Krumins personal blog

The Busy Beaver Problem

Busy Beaver puts another one on the Turing Machine's tape (image from the book The New Turing Omnibus). The busy beaver problem is a fun theoretical computer science problem. Intuitively, the problem is to find the smallest program that outputs as many data as possible and eventually halts. More formally it goes…
Points
64
HN comments
28
Submissions
1
Cited by
0 commenters

Math & AlgorithmsSoftware Engineering2009

On Hacker News

SubmittedTitle on HNPointsComments
Oct 29, 2009The Busy Beaver Problem by pkrumins6428

More from Peteris Krumins

All 57 posts →

Related posts from the same era