Holger Petersen Computable Lower Bounds for Busy Beaver Turing Machines. 305-319 2006 Recent Advances in Formal Languages and Applications http://dx.doi.org/10.1007/978-3-540-33461-3_12 series/sci/2006-25 db/series/sci/sci25.html#Petersen06