This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.H. Brady. The conjectured highest scoring machines for Rado’s Σ (k) for the value k = 4, IEEE Transactions on Electronic Computers, EC-15 (1966), 802-803.
A.H. Brady. Solution of the non-computable “Busy Beaver” game for k = 4, ACM Computer Science Conference (Washington DC, 1975), 1975, 27.
A.H. Brady. The determination of the value of Rado’s noncomputable function Σ (k) for four-state Turing machines, Mathematics of Computation, 40 (1983), 647-665.
A.H. Brady. The Busy Beaver Game and the meaning of Life, The Universal Turing Machine: A Half-Century Survey (R. Herken, ed.), Springer-Verlag, Berlin, 1994, 237-254.
M. Buro. Ein Beitrag zur Bestimmung von Rados Σ (5) oder Wie fängt man fleißige Biber? Technical Report 146, Rheinisch-Westfälische Technische Hochschule Aachen, 1990.
Gregory J. Chaitin. Computing the Busy Beaver function, Information, Randomness & Incompleteness: Papers on Algorithmic Information Theory, World Scientific, Series in Computer Science-Vol. 8, 1987, 74-76.
M.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, N.J., 1964), The Institute of Electrical and Electronics Engineers, Inc., 1964, 91-94.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
S. Lin and T. Rado. Computer studies of Turing machine problems, Journal of the Association for Computing Machinery, 12 (1965), 196-212.
H. Marxen and J. Buntrock. List of record machines, Available at: http://www.drb.insel.de/∼heiner/BB/bb-list.
H. Marxen and J. Buntrock. Attacking the Busy Beaver 5, Bulletin of the European Association for Theoretical Computer Science (EATCS), 40 (1990), 274-251.
P. Michel. Busy beaver competition and Collatz-like problems, Arch. Math. Logic, 32 (1993), 351-367.
T. Rado. On non-computable functions, The Bell System Technical Journal, 41 (1962),877-884.
T. Rado. On a simple source for non-computable functions, Proceedings of the Symposium on Mathematical Theory of Automata (New York, 1962), volume XII of Microwave Research Institute Symposia Series, Polytechnic Press of the Polytechnic Institute of Brooklyn, 1963, 75-81.
B. Weimann, K. Casper and W. Fenzl. Untersuchungen über haltende Programme für Turingmaschinen mit 2 Zeichen und bis zu 5 Befehlen, GI Gesellschaft für Informatik e.V.: 2. Jahrestagung (Karlsruhe, Germany, 1972), Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 1973, 72-81.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Holger Petersen. In: Esik, Z., Martín-Vide, C., Mitrana, V. (eds) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-33461-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-33461-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33460-6
Online ISBN: 978-3-540-33461-3
eBook Packages: EngineeringEngineering (R0)