Attacking the Busy Beaver 5
暂无分享,去创建一个
[1] T. Rado. On non-computable functions , 1962 .
[2] Allen H. Brady. The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4 , 1966, IEEE Trans. Electron. Comput..
[3] A. Tanenbaum. Computer recreations , 1973 .
[4] Donald S. Lynn. New Results for Rado's Sigma Function for Binary Turing Machines , 1972, IEEE Transactions on Computers.
[5] Jochen Ludewig,et al. Chasing the busy-beaver : notes and observations on a competition to find the 5-state busy beaver , 1983 .
[6] Shen Lin,et al. Computer Studies of Turing Machine Problems , 1965, JACM.
[7] B. Weimann,et al. Untersuchungen über haltende Programme für Turing-Maschinen mit 2 Zeichen und bis zu 5 Befehlen , 1972, GI Jahrestagung.
[8] Milton W. Green. A lower bound on Rado's sigma function for binary Turing machines , 1964, SWCT.