Review: R. Frejvald, Complexity of Recognition of Symmetry on Turing Machines with Input; A. M. Barzdin, Complexity of Recognition of Symmetry on Turing Machines [Book Review]

Journal of Symbolic Logic 35 (1):159-159 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271217

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

R. Fréjvald. Složnost' raspoznavaniá simmétrii na mašinah T'uringa s vhodom (Complexity of recognition of symmetry on Turing machines with input). Algébra l logika, Séminar, vol. 4 no. 1 (1965), pp. 47–58. - Á. M. Barzdin'. Složnost' raspoznavaniá simmétrii na mašinah T'úringa (Complexity of recognition of symmetry on Turing machines). Problémy kibérnětiki, vol. 15 (1965), pp. 245–248. [REVIEW]A. M. Barzdin - 1970 - Journal of Symbolic Logic 35 (1):159-159.
Review: A. M. Barzdin, On a Class of Turing Machines (Minsky Machines). [REVIEW]David S. Tartakoff - 1967 - Journal of Symbolic Logic 32 (4):523-524.
Review: Anna R. Bruss, Albert R. Meyer, On Time-Space Classes and their Relation to the Theory of Real Addition; Leonard Berman, The Complexity of Logical Theories; Hugo Volger, Turing Machines with Linear Alternation, Theories of Bounded Concatenation. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata.Oscar H. Ibarra - 1974 - Journal of Symbolic Logic 39 (1):188-189.
Review: M. D. Davis, A Note on Universal Turing Machines; Martin Davis, The Definition of Universal Turing Machine. [REVIEW]R. J. Nelson - 1970 - Journal of Symbolic Logic 35 (4):590-590.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Super turing-machines.B. Jack Copeland - 1998 - Complexity 4 (1):30-32.
The Demise of the Turing Machine in Complexity Theory.Iain A. Stewart - 1996 - In Peter Millican & Andy Clark (eds.), Machines and Thought: The Legacy of Alan Turing. Oxford, England: Oxford University Press.
Review: M. L. Minsky, Size and Structure of Universal Turing Machines using Tag Systems. [REVIEW]Martin Davis - 1966 - Journal of Symbolic Logic 31 (4):655-655.
Some upper and lower bounds on decision procedures in logic.Jeanne Ferrante - 1974 - Cambridge: Project MAC, Massachusetts Institute of Technology.

Analytics

Added to PP
2013-11-03

Downloads
11 (#1,149,206)

6 months
2 (#1,448,208)

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