A lower bound RADO's sigma function for binary turing machines

Authors:
Milton W. Green
Affiliations:
-
Venue:
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Year:
1964

Citing 0
Cited 3

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

IEEE Transactions on Computers
The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The busy beaver, the placid platypus and other crazy creatures

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

Quantified Score

Hi-index	0.00

Visualization

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.