DocumentCode
2204390
Title
A lower bound RADO´s sigma function for binary turing machines
Author
Green, Milton W.
fYear
1964
fDate
11-13 Nov. 1964
Firstpage
91
Lastpage
94
Abstract
In this note we show how to construct some simply-configured N-state 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.
Keywords
Helium; Magnetic heads; Printing; Turing machines; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching Circuit Theory and Logical Design, 1964 Proceedings of the Fifth Annual Symposium on
Conference_Location
Princeton, NJ, USA
Type
conf
DOI
10.1109/SWCT.1964.3
Filename
4569810
Link To Document