Phys. Rev. E 57, 3589–3592 (1998)Computing with cellular automata: Three cases for nonuniformityReceived 11 June 1997; revised 6 October 1997; published in the issue dated March 1998 Recently, there has been a resurgence of interest in the use of cellular automata (CA) as computational devices. This paper demonstrates the advantages of nonuniform CAs, in which cellular rules may be heterogeneous, over the classical, uniform model. We address three problems that require global computation: parity, symmetry, and synchronization, showing that: (1) there does not exist a uniform, radius r=1 CA that effectively computes a solution, while (2) construction of a nonuniform CA is straightforward. © 1998 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.57.3589
DOI:
10.1103/PhysRevE.57.3589
PACS:
89.80.+h, 02.70.Rw, 07.05.Bx
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.