OCA:Busy beaver
Jump to navigation
Jump to search
|
This article is a stub. You can help LifeWiki by expanding it. |
Busy beaver is a one-dimensional Turing machine devised by Radó in 1962. The busy beaver game aims to find a terminating program of a given size that (depending on definition) either produces the most output possible, or runs for the longest number of steps. Since an endlessly looping program producing infinite output or running for infinite time is easily conceived, such programs are excluded from the game. Rather than traditional programming languages, the programs used in the game are n-state Turing machines, one of the first mathematical models of computation.
See also
External links
- Busy beaver at Wikipedia