✦ LIBER ✦

Turing-Machine Computable Functionals of Finite Types II

✍ Scribed by Kleene, S. C.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turing-Machine Computable Functionals of

✍ Review by: D. A. Clarke 📂 Article 📅 1970 🏛 Association for Symbolic Logic 🌐 English ⚖ 362 KB

Computable functionals and arithmetic of

✍ V. A. Ganov 📂 Article 📅 1987 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 748 KB

The network complexity and the Turing ma

✍ C. P. Schnorr 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 745 KB

Computer Studies of Turing Machine Probl

✍ Lin, Shen; Rado, Tibor 📂 Article 📅 1965 🏛 Association for Computing Machinery 🌐 English ⚖ 1002 KB

Computational Complexity of One-Tape Tur

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

Subclasses of Turing machines reducible

✍ Yu. Ya. Breitbart; V. A. Kozmidiadi 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 882 KB