The Busy Beaver Problem
A NEW MILLENNIUM ATTACK
|
Subset Loops
A Turing machine M is
classified as a subset loop if the following properties are true:
|
Non Halt Detection
Non
Halters
Backtrackers Subset Loops Simple Loops Christmas Trees Alternating Christmas Trees Counters 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 |