Shen Lin and Tibor Rado. Computer studies of Turing machine problems. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 196–212. - Allen H. Brady. The conjectured highest scoring machines for Rado's Σ(k) for the value k = 4. IEEE transactions on electronic computers, vol. EC-15 (1966), pp. 802–803. - Milton W. Green. A lower bound on Rado's sigma function for binary Turing machines. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11-13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York 1964, pp. 91–94.

1975 ◽  
Vol 40 (4) ◽  
pp. 617-617
Author(s):  
H. B. Enderton
Sign in / Sign up

Export Citation Format

Share Document