✦ LIBER ✦

Computer Studies of Turing Machine Problems

✍ Scribed by Lin, Shen; Rado, Tibor

Book ID: 121759560
Publisher: Association for Computing Machinery
Year: 1965
Tongue: English
Weight: 1002 KB
Volume: 12
Category: Article
ISSN: 0004-5411
DOI: 10.1145/321264.321270

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computer Studies of Turing Machine Probl

Computer Studies of Turing Machine Problems.by Shen Lin; Tibor Rado;The Conjectured Highest Scoring Machines for Rado's ∑(k) for the Value K = 4.by Allen H. Brady;A Lower Bound on Rado's Sigma Function for Binary Turing Machines.by Milton W. Green

✍ Review by: H. B. Enderton 📂 Article 📅 1975 🏛 Association for Symbolic Logic 🌐 English ⚖ 86 KB

Computability by Probabilistic Turing Ma

Computability by Probabilistic Turing Machines

✍ Eugene S. Santos 📂 Article 📅 1971 🏛 American Mathematical Society 🌐 English ⚖ 389 KB

Computational Complexity of One-Tape Tur

Computational Complexity of One-Tape Turing Machine Computations

✍ Hartmanis, J. 📂 Article 📅 1968 🏛 Association for Computing Machinery 🌐 English ⚖ 779 KB

Tape-reversal bounded turing machine com

Tape-reversal bounded turing machine computations

✍ J. Hartmanis 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 667 KB

This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are inves

Turing machines,computers,and artificial

Turing machines,computers,and artificial intelligence

✍ Krebs P.R. 📂 Library 📅 2002 🌐 English ⚖ 232 KB

Do Accelerating Turing Machines Compute

Do Accelerating Turing Machines Compute the Uncomputable?

✍ B. Jack Copeland; Oron Shagrir 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 357 KB