Skip to main content

SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY.

Publication ,  Journal Article
Gacs, P; Reif, JH
Published in: Conference Proceedings of the Annual ACM Symposium on Theory of Computing
January 1, 1985

We build a three-dimensional array of unreliable cellular automata that can simulate a universal Turing machine (more generally, a one-dimensional universal iterative array) reliably. This is the first reliable real-time simulation. The encoding is simple repetition, and no decoding is needed.

Duke Scholars

Published In

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ISSN

0734-9025

Publication Date

January 1, 1985

Start / End Page

388 / 395
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Gacs, P., & Reif, J. H. (1985). SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY. Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 388–395.
Gacs, P., and J. H. Reif. “SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY.Conference Proceedings of the Annual ACM Symposium on Theory of Computing, January 1, 1985, 388–95.
Gacs P, Reif JH. SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1985 Jan 1;388–95.
Gacs, P., and J. H. Reif. “SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY.Conference Proceedings of the Annual ACM Symposium on Theory of Computing, Jan. 1985, pp. 388–95.
Gacs P, Reif JH. SIMPLE THREE-DIMENSIONAL REAL-TIME RELIABLE CELLULAR ARRAY. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1985 Jan 1;388–395.

Published In

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ISSN

0734-9025

Publication Date

January 1, 1985

Start / End Page

388 / 395