Sciweavers

CATS
2006
13 years 6 months ago
The Busy Beaver, the Placid Platypus and other Crazy Creatures
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
James Harland
CATS
2007
13 years 6 months ago
Analysis of Busy Beaver Machines via Induction Proofs
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
James Harland