The Community for Technology Leaders
RSS Icon
Subscribe
Nov. 11, 1964 to Nov. 13, 1964
pp: 91-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.
CITATION
Milton W. Green, "A lower bound RADO's sigma function for binary turing machines", FOCS, 1964, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1964, pp. 91-94, doi:10.1109/SWCT.1964.3
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool