Completeness problem of one-dimensional binary scope-3 tessellation automata
Akira Maruoka,Masayuki Kimura +1 more
Reads0
Chats0
TLDR
It is shown that any finite state pattern can evolve from the starting pattern in the case where the neighborhood scope is three or more and the cell in the array has 2^i3^j states.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1974-08-01 and is currently open access. It has received 10 citations till now. The article focuses on the topics: Tessellation (computer graphics) & Sequence.read more
Citations
More filters
Journal ArticleDOI
A brief history of cellular automata
TL;DR: A history of cellular automata from their beginnings with von Neumann to the present day is traced, mainly on topics closer to computer science and mathematics rather than physics, biology or other applications.
Journal ArticleDOI
Injectivity and surjectivity of parallel maps for cellular automata
Akira Maruoka,Masayuki Kimura +1 more
TL;DR: Four new properties of parallel maps for cellular automata are defined, viz., strong surjectiveness, weak surjection, strong injectiveness, and weak injectiveness that are nonequivalent to previously known properties and bridge the gap between bijectiveness and surjection.
Journal ArticleDOI
A completeness property of one-dimensional tessellation automata
Masakazu Nasu,Namio Honda +1 more
TL;DR: It is shown that if k>=3, any finite k-symbols pattern whose length is greater than 1 can be generted strictly monotonously from the primitive pattern by some sequence of parallel transformations of a k-Symbols scope-n tessellation automaton for any n>.
Journal ArticleDOI
A function for evaluating the computing time of a bubbling system
Kazuhiro Sado,Yoshihide Igarashi +1 more
TL;DR: It is shown that the number of steps for a given bubbling system B to reach its equilibrium configuration from its configuration at the t th step is evaluated by POTENTIAL ( B, t ).
Journal ArticleDOI
Completeness problem of multidimensional tessellation automata
Akira Maruoka,Masayuki Kimura +1 more
TL;DR: It is proved that, for any d ⩾ 1 and q ⩽ 2, a d-dimentional q-state tessellation automaton with von Neumann neighborhood index is complete.
References
More filters
Book
Theory of Self-Reproducing Automata
John von Neumann,Arthur W. Burks +1 more
TL;DR: This invention relates to prefabricated buildings and comprises a central unit having a peripheral section therearound to form a main residential part defined by an assembly of juxtaposed roofing and facing trusses.
Proceedings ArticleDOI
A computer oriented toward spatial problems
TL;DR: A stored program computer is described which can handle spatial problems by operating directly on information in planar form without scanning or using other techniques for transforming the problem into some other domain.
Journal ArticleDOI
Pattern Detection and Recognition
TL;DR: Two types of pattern-processing problems are discussed in this paper and recognition and detection have been successfully carried out on an IBM 704 computer programmed to simulate a spatial computer (a stored-program machine comprised of a master control unit directing a network of logical modules).
Journal ArticleDOI
Numerical testing of evolution theories
TL;DR: An interpretive system for the IBM 704 computer permitting interpretation of the genetic pattern of a numeric symbioorganism as a game strategy has been developed in this paper, where the game called Tac Tix was applied in a preliminary experiment.
Related Papers (5)
A completeness problem for pattern generation in tessellation automata
H. Yamada,Serafino Amoroso +1 more
Tessellation structures for reproduction of arbitrary patterns
Serafino Amoroso,Gerald Cooper +1 more