Belyakin N. V.. A certain class of Türing machines. English translation of XXXVII 211. Soviet physics, Doklady, vol. 8 no. 1 , pp. 3–4 [Book Review]

Journal of Symbolic Logic 37 (1):198-198 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272618

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: N. V. Belyakin, A Certain Class of Turing Machines. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (1):198-198.
Jankov V. A.. Constructing a sequence of strongly independent superintuitionistic propositional calculi. English translation of XXXVII 206 by Yablonsky A.. Soviet mathematics, vol. 9 no. 4 , pp. 806–807.Jankov V. A.. The calculus of the weak “law of excluded middle.” English translation of XXXVII 206. Mathematics of the USSR—Izvestija , vol. 2 no. 5 , pp. 997–1004. [REVIEW]Alfred Horn - 1972 - Journal of Symbolic Logic 37 (1):186-186.
Nechiporuk E. I.. On the synthesis of logical nets in incomplete and degenerate basis. English translation of XXXVI 570. Soviet physics, Doklady, vol 9 no. 3 , pp. 207–208. [REVIEW]Louis Hodes - 1971 - Journal of Symbolic Logic 36 (3):548-548.
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Lupanov O. B.. Implementing the algebra of logic functions in terms of bounded depth formulas in the basis of &, ν, ¯. English translation of XXXVI 572. Soviet physics, Doklady, vol. 6 no. 2 , pp. 107–108. [REVIEW]Louis Hodes - 1971 - Journal of Symbolic Logic 36 (3):547.
Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
From Symbol to ‘Symbol’, to Abstract Symbol: Response to Copeland and Shagrir on Turing-Machine Realism Versus Turing-Machine Purism.Eli Dresner & Ofra Rechter - 2016 - Minds and Machines 26 (3):253-257.
Jankov V. A.. Conjunctively indecomposable formulas in propositional calculi. English translation of XXXVII 206. Soviet mathematics, vol. 3 no. 1 , pp. 17–35. [REVIEW]C. G. McKay - 1972 - Journal of Symbolic Logic 37 (1):186-186.
Grindlingér É. I.. O nérazréšimosti problémy toždéstva slov dlá odnogo klassa polugrupp s razréšimoj problèmoj izomorfizma. Doklady Akadémii Nauk SSSR, vol. 171 , pp. 519–520.Grindlinger [Greendlinger] E. I.. On the unsolvability of the word problem for a class of semigroups with a solvable isomorphism problem. English translation of the preceding by Greendlinger M.. Soviet mathematics, vol. 7 no. 6 , pp. 1502–1503. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Čudnovskiǐ G. V.. Some results in the theory of infinitely long expressions. English translation of XXXVII 215 by Mendelson E.. Soviet mathematics, vol. 9 no. 2 , pp. 556–559. [REVIEW]E. G. K. López-Escobar - 1972 - Journal of Symbolic Logic 37 (1):202-203.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
I. Žuravlév Ú.. O névozmožnosti postroéniá minimal'nyh dizúnktivnyh normal'nyh form funkcij algébry logiki v odnom kassé algoritmov. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 504–506.Žuravlev Yu. I.. On the impossibility of constructing minimal disjunctive normal forms for functions of the algebra of logic in a single class of algorithms. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 581–583. [REVIEW]Andrzej Rowicki - 1965 - Journal of Symbolic Logic 30 (3):379-379.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.

Analytics

Added to PP
2016-06-30

Downloads
2 (#1,722,101)

6 months
1 (#1,346,405)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references