Simple Computation-Universal Cellular Spaces

117Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

The specialization of the theory of cellular spaces (cellular automata) to those spaces which compute partial recursive functions is presented. Neighborhood reduction and state-set reduction are shown to be particularly simple in this special theory, and one dimension is proved to be sufficient for computation universality. Several computation-universal cellular spaces (CUCS's) are exhibited which are simple in the sense that each cell has only a small number q of states and a small number p of neighbors. For example, a 1-dimensional CUCS with pq = 36 is presented. Two quite different proofs of the existence of a I-dimensional CUCS with only two neighbors are given. Finally, one of the theorems derived is used to settle three open decidability questions. © 1971, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Smith, A. R. (1971). Simple Computation-Universal Cellular Spaces. Journal of the ACM (JACM), 18(3), 339–353. https://doi.org/10.1145/321650.321652

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free