Computer Studies of Turing Machine Problems

A bound on the shift function in terms of the Busy Beaver function

ACM SIGACT News

Information-Theoretic Limitations of Formal Systems

Journal of the ACM (JACM)

The busy beaver on a one-way infinite tape

ACM SIGACT News

Small turing machines and generalized busy beaver competition

Theoretical Computer Science

The busy beaver, the placid platypus and other crazy creatures

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51

From Machine and Tape to Structure and Function: Formulation of a Reflexively Computing System

Artificial Life

Analysis of busy beaver machines via induction proofs

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65

New Results for Rado's Sigma Function for Binary Turing Machines

IEEE Transactions on Computers

On the complex behavior of simple tag systems-An experimental approach

Theoretical Computer Science

Computer runtimes and the length of proofs: with an algorithmic probabilistic application to waiting times in automatic theorem proving

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond

The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Towards methods for discovering universal Turing machines (or how universal unicorns can be discovered, not created)

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

The busy beaver, the placid platypus and other crazy creatures

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

Busy beaver machines and the observant otter heuristic

CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141