Loading [a11y]/accessibility-menu.js
New Results for Rado's Sigma Function for Binary Turing Machines | IEEE Journals & Magazine | IEEE Xplore

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


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 More

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)
Page(s): 894 - 896
Date of Publication: 29 May 2009

ISSN Information:


References

References is not available for this document.