02557nmm a2200349 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002400139245010500163250001700268260004800285300003300333653002000366653002100386653001800407653002500425653003200450653002600482653001600508653005600524700003200580041001900612989003800631490004400669028003000713856007200743082001000815520138200825EB000721197EBX0100000000000000057427900000000000000.0cr|||||||||||||||||||||140122 ||| eng a97894015922391 aGoles, E.e[editor]00aCellular Automata and Complex SystemshElektronische Ressourcecedited by E. Goles, Servet MartÃnez a1st ed. 1999 aDordrechtbSpringer Netherlandsc1999, 1999 aVIII, 182 pbonline resource aComplex Systems aComputer science aSystem theory aMathematical physics aApplications of Mathematics aTheory of Computation aMathematics aTheoretical, Mathematical and Computational Physics1 aMartÃnez, Servete[editor]07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aNonlinear Phenomena and Complex Systems50a10.1007/978-94-015-9223-940uhttps://doi.org/10.1007/978-94-015-9223-9?nosfx=yxVerlag3Volltext0 a530.1 aThis book contains the courses given at the Fifth School on Complex Systems held at Santiago, Chile, from 9th .to 13th December 1996. At this school met researchers working on areas related with recent trends in Complex Systems, which include dynamical systems, cellular automata, symbolic dynamics, spatial systems, statistical physics and thermodynamics. Scientists working in these subjects come from several areas: pure and applied mathematics, physics, biology, computer science and electrical engineering. Each contribution is devoted to one of the above subjects. In most cases they are structured as surveys, presenting at the same time an original point of view about the topic and showing mostly new results. The paper of Bruno Durand presents the state of the art on the relationships between the notions of surjectivity, injectivity and reversibility in cellular automata when finite, infinite or periodic configurations are considered, also he discusses decidability problems related with the classification of cellular automata as well as global properties mentioned above. The paper of Eric Goles and Martin Matamala gives a uniform presentation of simulations of Turing machines by cellular automata. The main ingredient is the encoding function which must be fixed for all Turing machine. In this context known results are revised and new results are presented