
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
A lower bound RADO's sigma function for binary turing machines
November 11November 13
ASCII Text  x  
Milton W. Green, "A lower bound RADO's sigma function for binary turing machines," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 9194, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964.  
BibTex  x  
@article{ 10.1109/SWCT.1964.3, author = {Milton W. Green}, title = {A lower bound RADO's sigma function for binary turing machines}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {1964}, isbn = {}, pages = {9194}, doi = {http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.3}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  A lower bound RADO's sigma function for binary turing machines SN  SP91 EP94 A1  Milton W. Green, PY  1964 VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.3
In this note we show how to construct some simplyconfigured Nstate binary Turing machines that will start on a blank tape and eventually halt after printing a very large number of ones. The number of ones produced by these machines can be expressed analytically in terms of functional difference equation. The latter expression furnishes the best lower bound presently known for Rado's noncomputable function, Σ(N), when N > 5.
Citation:
Milton W. Green, "A lower bound RADO's sigma function for binary turing machines," focs, pp.9194, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964
Usage of this product signifies your acceptance of the Terms of Use.