✦ LIBER ✦

Comparing Verboseness for Finite Automata and Turing Machines

✍ Scribed by Till Tantau

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subclasses of Turing machines reducible

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

A relationship between Turing machines a

✍ Makoto Sakamoto; Satoshi Okatani; Masatsugu Fukuda; Takao Ito; Hiroshi Furutani; 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 286 KB

Optimal simulation of two-dimensional al

✍ Akira Ito; Katsushi Inoue; Itsuo Takanami; Yue Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 633 KB

A relationship between two-dimensional f

✍ Katsushi Inoue; Itsuo Takanami; Hiroshi Taniguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 583 KB

The network complexity and the Turing ma

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

Quantificational variants on the halting

✍ Patrick C. Fischer 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB