Journal of Symbolic Logic

Review: N. V. Belakin, The Universality of a Computing Machine with Potentially Infinite Exterior Memory

E. M. Fels
Source: J. Symbolic Logic Volume 27, Issue 3 (1962), 366.

Reviewed Works:

N. V. Belakin, The Universality of a Computing Machine with Potentially Infinite Exterior Memory.

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/1183734545
JSTOR: links.jstor.org


2013 © Association for Symbolic Logic

Journal of Symbolic Logic

Journal of Symbolic Logic

Turn MathJax Off
What is MathJax?