Journal of Symbolic Logic

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

Albert A. Mullin
Source: J. Symbolic Logic Volume 35, Issue 1 (1970), 159.

Reviewed Works:

R. Frejvald, Complexity of Recognition of Symmetry on Turing Machines with Input.

A. M. Barzdin, Complexity of Recognition of Symmetry on Turing Machines.

Full-text: Remote access
If you are a member of the ASL, log in to Euclid for access.
Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.jsl/1183737096
JSTOR: links.jstor.org


2013 © Association for Symbolic Logic

Journal of Symbolic Logic

Journal of Symbolic Logic

Turn MathJax Off
What is MathJax?