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, Prin

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, Prin

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of symbolic logic 1975-12, Vol.40 (4), p.617-617
1. Verfasser: Enderton, H. B.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:
ISSN:0022-4812
1943-5886
DOI:10.2307/2271827