[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Simple Computation-Universal Cellular Spaces

Published: 01 July 1971 Publication History
First page of PDF

References

[1]
ARBIB, M.A. A simple self-reproducing universal automaton. Inform. Contr. 9 (1966), 188-189.
[2]
BALZER, R.M. Studies concerning minimal time solutions to the firing squad synchronization problem. Ph.D. dissertation, Carnegie Inst. of Tech., Pittsburg, Pa., 1966.
[3]
CODD, E. F. Cellular Automata. ACM Monograph Series, Academic Press, New York, 1968.
[4]
KILMER, W.L. On dynamic switching in one-dimensional iterative logic networks. Inform. Contr. 6 (1963), 399-415.
[5]
LEE, C.Y. Synthesis of a cellular computer. In Applied Automata Theory, J. T. Tau, Ed., Academic Press, New York, 1968, pp. 217-234.
[6]
LIEBLEIN, E. A theory of patterns in two-dimensonal tessellation space. Ph.D. dissertation, University of Pennsylvania, Philadelphia, Pa., 1968.
[7]
MINSKY, M. Computation: Finite and Infinite Machines. Prentice-Hail, Englewood Cliffs, N. J., 1967.
[8]
ROGERS, H., JR. Theory of Recursive Functions and Effective Computability. McGraw- Hill, New York, 1967.
[9]
SHANNON, C. E. A universal Turing machine with two internal states. In Automata Studies, C. E. Shannon and J. McCarthy, Eds., Princeton U. Press, Princeton, N. J., 1956.
[10]
SMITH, A. R., III. Simple computation-universal cellular spaces and self-reproduction. Proc. IEEE Ninth Annual Switching and Automata Theory Symp., pp. 269-277.
[11]
SMITH, A. R., III. Cellular automata theory. Tech. Rep. 2, Digital Systems Lab., Stanford U., Stanford, Calif., 1970.
[12]
SMITH, A. R., III. Cellular automata complexity trade-offs. Inform. Contr. 18 (1971) (In press).
[13]
SMITH, A. R., III. General shift-register sequences of arbitrary cycle length. IEEE Trans. Comp. C-SO (1971), 456--459.
[14]
THATCHER, J.W. Universality in the yon Neumann cellular model. Tech. Rep. 03105- 30-T, ORA, U. of Michigan, Ann Arbor, 1964.
[15]
VON NEUMANN, J. The Theory of Self-Reproducing Automata, A. W. Burks, Ed. U. of Illinois Press, Urbana, Ill. 1966.
[16]
WAGNER, E.G. An approach to modular computers I: Spider automata and embedded automata. Tech. Rep. IBM RC 1107, IBM Watson Research Lab., Yorktown Heights, N.Y., 1964.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 18, Issue 3
July 1971
147 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/321650
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1971
Published in JACM Volume 18, Issue 3

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)96
  • Downloads (Last 6 weeks)12
Reflects downloads up to 11 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Quantum Cellular Automata for Quantum Error Correction and Density ClassificationPhysical Review Letters10.1103/PhysRevLett.133.150601133:15Online publication date: 7-Oct-2024
  • (2024)Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular AutomataLATIN 2024: Theoretical Informatics10.1007/978-3-031-55601-2_18(272-286)Online publication date: 18-Mar-2024
  • (2022)Complexity-theoretic aspects of expanding cellular automataNatural Computing: an international journal10.1007/s11047-020-09814-221:1(53-65)Online publication date: 1-Mar-2022
  • (2022)On Boolean Automata Isolated Cycles and Tangential Double-Cycles DynamicsAutomata and Complexity10.1007/978-3-030-92551-2_11(145-178)Online publication date: 20-Apr-2022
  • (2021)A Framework for Implementing Metaheuristic Algorithms Using Intercellular CommunicationFrontiers in Bioengineering and Biotechnology10.3389/fbioe.2021.6601489Online publication date: 10-May-2021
  • (2021)Communication complexity meets cellular automata: Necessary conditions for intrinsic universalityNatural Computing: an international journal10.1007/s11047-021-09857-z20:2(307-320)Online publication date: 1-Jun-2021
  • (2021)Cellular AutomataErgodic Dynamics10.1007/978-3-030-59242-4_14(255-278)Online publication date: 29-Jan-2021
  • (2020)Artificial life in an exciton-polariton latticeNew Journal of Physics10.1088/1367-2630/abc29022:10(103062)Online publication date: 2-Nov-2020
  • (2020)A survey of cellular automata: types, dynamics, non-uniformity and applicationsNatural Computing: an international journal10.1007/s11047-018-9696-819:2(433-461)Online publication date: 1-Jun-2020
  • (2019)Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumerationChaos: An Interdisciplinary Journal of Nonlinear Science10.1063/1.508988929:6Online publication date: 25-Jun-2019
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media