Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $\sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines
Enderton, H. B.
J. Symbolic Logic, Tome 40 (1975) no. 1, / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1975-12-14
Classification:  
@article{1183739625,
     author = {Enderton, H. B.},
     title = {Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $\sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines},
     journal = {J. Symbolic Logic},
     volume = {40},
     number = {1},
     year = {1975},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183739625}
}

Enderton, H. B. Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $\sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines. J. Symbolic Logic, Tome 40 (1975) no. 1, . http://gdmltest.u-ga.fr/item/1183739625/