Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!unido!rwthinf!shiva!heller From: heller@shiva.informatik.rwth-aachen.de (Manfred Heller) Newsgroups: comp.theory.cell-automata Subject: summary of lit-request Summary: answers of lit-req Keywords: CA literature Message-ID: Date: 3 Dec 90 11:05:53 GMT Sender: news@rwthinf.UUCP Lines: 159 Now here is a list of responses I got concerning my call for literature pointers: (All other mails were my-lit-requests) From nigel@ATHENA.MIT.EDU Tue Nov 6 10:27:13 1990 I would suggest trying to find Theory and Applications of Cellular Automata by Stephen Wolfram. This book starts by considering all of the theoretical issues underlying CA (group/field approaches, covergence and reversibility etc) and then starts to look at specific applications which have been successful using CA. I don't have the publisher's name with me right now but if you want I'm sure that I can find it. Write back if you want or need more help! George Schmitt nigel@athena.mit.edu From wli@sfi.santafe.edu Wed Nov 7 07:38:42 1990 The Proceeding of 1989 Cellular Automata Conference will be published in the forthcoming issue of Physica D, vol 45. It will also be in a book form later. If you didn't know it yet, there is also a paper collection ed. by Wolfram (Theory and Applications of Cellular Automata, World Scientific). But it has been four years old now. Wentian Li wli@sfi.santafe.edu From jhaataja@finsun.csc.fi Sat Nov 17 01:45:02 1990 In comp.theory.cell-automata you write: >Is anybody out there who knows about some -recent- literature (articles, >abstracts or books) concerning cellular automata theory ? Well, here follows some info. I hope this helps. - Juha Haataja ---------------------------------------------------------------------- The following journal is devoted to CA and neural networks - and it also is quite up to date: Complex Systems (Editor Stephen Wolfram) You could also try to get articles from the NORDITA preprint series (it's mainly physics, but some CA theory is also included). The address is: NORDITA Blegdamsvej 17 DK-2100 Copenhagen O Denmark The following are somewhat older references; most of them have large lists of other useful references. A nice and concise introduction to CA is: Cellular Automata and Modeling of Complex Physical Systems (P. Manneville et al, Springer-Verlag 1989) This is a collection of papers, the emphasis being on the modeling of physical systems on CA (fluids, lattice gases etc). There is also a new short and very nice general paper on CA: Cellular Automata (Peter Grassberger, Physics Department, University of Wuppertal, 1990) The viewpoint is inclined towards physics, but otherwise this is definitely a very good introduction. This paper also has a large reference list, so that should help too. In the proceedings of Workshop on Computational Physics and Cellular Automata (World Scientific 1990; Ed. A. Pires, D.P. Landau and H. Herrman) there are some fairly recent articles about the physical aspects of CA. From wli%raven@LANL.GOV Sat Nov 17 10:55:27 1990 In article you write: > > >Hello! > >Is anybody out there who knows about some -recent- literature (articles, >abstracts or books) concerning cellular automata theory ? I've looked around >for this kind-a-stuff for some weeks now, but all I found were those older >Preston-Duff-Codd-Gardener classics. > >No, I'm neither interested in patterns-of-growth-theory, nor in exclusively >graphic-oriented image processing algorithms. My interest is focussed on >the convergence of global states in a multi-cell-state, infinite plane cellular >machine after applying some local transform often enough (but maybe literature >about similar themes is helpful). > >If anyone is interested in my work or in a list of the literature -I- use, >please send a note with a full (& working) email address. > >Hopefully awaiting your postings > >post scriptum... Thank you, Mr. Li!. Thank you, Mr. Schmitt! >-- >Mail : Manfred Heller, Schwarzer Dyck 43, W-4174 Issum 1, Germany >Phone : +49-2835-1528 >Domain: heller@cip-s02.informatik.rwth-aachen.de >Bang : ..mcvax!unido!rwthinf!cip-s02!heller I would be interested in your work or the literature you used. I read one paper by F. Fogelman-Soulie in "Theoretical Computer Science" (40, 275--300 (1985)), not quite sure whether it's relevant. The problem with global state space is that you represent every sequence by a point indiscriminately. For example, both 00000000 and 101010010 are points in the state space. You cannot distinguish the two. It is a big drawback if you are interested in the spatial structure genertated. Also, if you are interested in the transient time for "chaotic" CAs, in state space picture, the transient is roughly exponentially proportional to the lattice size. On the other hand, if you look at the real spatial pictures, the transient seems to be rather short, because the transient sequences look just like the limiting sequences. So for practical purposes, to say "transient is very short" should also be correct. Wentian Li wli@sfi.santafe.edu Greetings Manfred Heller -- Mail : Manfred Heller, Schwarzer Dyck 43, W-4174 Issum 1, Germany Phone : +49-2835-1528 Domain: heller@cip-s02.informatik.rwth-aachen.de Bang : ..mcvax!unido!rwthinf!cip-s02!heller Brought to you by Super Global Mega Corp .com