The Busy Beaver Problem
A NEW MILLENNIUM ATTACK
|
Holdouts
A holdout is a machine that fails to
fall into one of the defined categories specified on the status
page. This category is of the most interest for once its
value is reduced to zero, the value of the Busy Beaver function
for that particular value of n is explicitly confirmed.
|
Project Components
Current Champions
RSet by present RPI effort MSet by Machado and Pereira OSet by Oberschelp, et al. TTrivial records ?Unknown origin Also note: A solid yellow background indicates records have been explicitly confirmed by the present effort. A faded yellow indicates relative confidence but not yet an explicit proof. Busy Beaver Research Team
Bram van Heuveln
Selmer Bringsjord Boleslaw Szymanski Carlos Varela Kyle Ross Owen Kellett Shailesh Kelkar |