Abstract:
A computer program was written and executed to search for better lower bounds to Rado's noncomputable sigma and shift functions for binary Turing machines. Former results...Show MoreMetadata
Abstract:
A computer program was written and executed to search for better lower bounds to Rado's noncomputable sigma and shift functions for binary Turing machines. Former results in this search (called by Rado the Busy Beaver logical game) are reviewed and new bounds found by this program are presented.
Published in: IEEE Transactions on Computers ( Volume: C-21, Issue: 8, August 1972)