Abstract
In view of how tractable linear rules turn out to be, one is encouraged to investigate similar questions for more general rules. A natural next step is to make the next state of a center cell depend, not linearly on the full local distribution of neighboring cells, but rather on the their density and, possibly, its own state. For instance, under a majority rule for an elementary celullar automaton the center cell polls its neighbors for a state and goes with the majority (ties are broken arbitrarily by the center cell, for instance by keeping its current state). These rules are called semi-totalistic. In the particular case of elementary automata, it is necessary to reduce this total count to a binary value. The simplest way to achieve this reduction is to set up a minimal threshold value for the count to become 1.
Article Note
Aye on the shores of darkness there is light, And precipices show untrodden green, There is a budden morrow in midnight, There is a triple sight in blindness keen.
John Keats
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Albert and K. Culik II: A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1 (1987) 1–16
E.R. Banks: Information processing and transmission in cellular automata. Doctoral dissertation, MIT, 1971
R. Bartlett: Discrete computation in the continuum. Doctoral dissertation, Department of Mathematical Sciences, The University of Memphis, 1994
C. Bays: Candidates for the game of Life in three dimensions. J. Complex Systems 1 (1987) 373–400
C. Bays: The discovery of a new glider for the game of three-dimensional life. J. Complex Systems 4:6 (1987) 373–400
C. Bays: A new game of three-dimensional life. J. Complex Systems 5:1(1991) 15–18
C. Bays: Classification of semitotalistic cellular automata in three dimensions. Complex Systems 2:2 (1988) 235–254
E.R. Berlekamp, J.H. Conway, R. K. Guy: Winning ways for your mathematical plays, vol. 2. Academic Press, New York, 1982
H. K. Buening, T. Ottman: Kleine Universale mehrdimensionale Turing– maschinen. Elektron. Inf. und Kybernetik 13 (1977) 179–201
E.F. Codd: Cellular Automata. Academic Press, New York, 1968
A.K. Dewdney: Computer recreations. Scientific American 252:5 (1985) 18–24
M. Gardner: The fantastic combinations of John Conway’s new game of ‘life’. Scientific American (Oct. 1970) 100–123
E. Goles, S. Martinez: Neural networks: theory and applications, Kluwer, Amsterdam, 1990
E. Goles, J. Olivos: Comportement périodique des fonctions à seuil binaires et applications. Discr. Appl. Math. 3 (1981) 93–105
E. Goles, M. Tchuente: Iterative behavior of one-dimensional threshold automata. Discr. Appl. Math. 8 (1984) 319–322
D. Gordon: On the computational power of totalistic cellular automata. Math. Syst. Theory 20:1 (1987) 43–52
E. Jen: Invariant strings and pattern recognizing properties of one- dimensional cellular automata. J. Stat. Physics 43:1–2 (1986) 243–265
Y. Kobuchi: A note on symmetrical cellular spaces. Inform. Process. Lett. 25:6 (1987) 413–415
C. G. Langton: Self-reproduction in cellular automata. In: Proc. Los Alamos workshop on cellular automata. North-Holland, Amsterdam, 1983, pp. 135–144
C. Lee: Synthesis of a cellular computer. In: Applied automata theory. Julius T. Ton (ed.): Academic Press, 1968, pp. 217–234
K. Lindgreen, M.G. Nordhal: Universal computation in simple one- dimensional cellular automata. Complex Systems 4:3 (1990) 299–318
N. Margolus: Physics-like models of computation. Physica D 10 (1984) 83–95
K. Preston, Jr, M.J.B. Duff: Modern cellular automata. Plenum Press, New York, 1984
A.R. Smith III: Simple Computation-universal cellular spaces. J. Assoc. Comput. Mach. 18 (1971) 339–353
H. Szwerinski: Symmetrical one-dimensional cellular spaces. Inform, and Control 67:1–3 (1985) 167–172
T. Toffoli & N. Margolus: Cellular automata machines (a new environment for modeling). MIT Press, Cambridge MA, 1987
A. M. Turing: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 (1936) 230–265.
A. M. Turing A correction, ibid 43 (1936) 544–546
J. von Neumann, A. W. Burks (ed.): Theory of self-reproducing automata. University of Illinois Press, Urbana, 1966
S. Wolfram: Statistical mechanics of cellular automata. Reviews of Modern Physics 55:3(1983) 601–644. Reprinted in [Wo3]
S. Wolfram: Universality and complexity in cellular automata. In: Proc. of a conference on Cellular Automata in Los Alamos, North-Holland, Amsterdam, 1983. Reprinted in [Wo3]
S. Wolfram: Theory and Applications of cellular automata. World Scientific, Singapore, 1986
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Garzon, M. (1995). Semi-totalistic Automata. In: Models of Massive Parallelism. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77905-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-77905-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77907-7
Online ISBN: 978-3-642-77905-3
eBook Packages: Springer Book Archive