The web pages of Pascal MICHELIncluding : Busy Beaver competition, Publications in Logic and Theoretical Computer Science.
Last update: November 2013
(May 2012): An analysis of the machine found in June 2010 by Pavel Kropitz with s(M) > 7.4 × 10^36534 and sigma(M) > 3.5 × 10^18267.
(January 2011): Two new parts in the advanced topics:
1 - Methods to find busy beavers
2 - Busy beavers and unprovability.
Click here to send email
Link to home page of the Équipe de Logique Mathématique