From cellular-automata-request@Think.COM Fri Jan 1 16:45:09 1993 Received: by mail.think.com; Fri, 1 Jan 93 16:45:12 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 1 Jan 93 16:45:09 -0500 Received: from sjsumcs.SJSU.EDU by Early-Bird.Think.COM; Fri, 1 Jan 93 16:45:06 EST Received: by sjsumcs.SJSU.EDU (5.65c/IDA-1.4.4) id AA20860; Fri, 1 Jan 1993 13:45:34 -0800 Date: Fri, 1 Jan 1993 13:45:34 -0800 From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker) Message-Id: <199301012145.AA20860@sjsumcs.SJSU.EDU> To: ca@Think.COM Subject: evolving cas The idea of evolving CA rules is an interesting one --- it would not be too hard to create a "Blind Watchmaker" style program where the user clicks on one of, say, 6 small CA patches to choose to see 6 mutations of that one, etc. Automated evolution would also be reasonable, one might choose a certain entropy level as the fitness target. Charles Bennett showed me a rule for the Margolus and Toffoli CAM6 which lets the user flip between two active CAs and choose one, then see two mutants of that one, etc. I don't know of any other existing program that does this kind of thing. There was a paper by Norman Packard, I believe, in which he did an automatic evolution of a 1D CA towards some goal --- the reference has appeared on this newsgroup before. If I get time, I'll try and put an evolving CA feature into the "Bugland" program which I am now developing for distribution next fall. From cellular-automata-request@Think.COM Fri Jan 1 16:50:15 1993 Received: by mail.think.com; Fri, 1 Jan 93 16:50:17 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 1 Jan 93 16:50:15 -0500 Received: from sjsumcs.SJSU.EDU by Early-Bird.Think.COM; Fri, 1 Jan 93 16:50:13 EST Received: by sjsumcs.SJSU.EDU (5.65c/IDA-1.4.4) id AA20881; Fri, 1 Jan 1993 13:50:39 -0800 Date: Fri, 1 Jan 1993 13:50:39 -0800 From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker) Message-Id: <199301012150.AA20881@sjsumcs.SJSU.EDU> To: ca@Think.COM Subject: 3D BZ There is a lovely photo of a 3D Belusov-Zhabotinsky type CA (scrolls) on p. 111 of the coffee-table paperback FRACTALS THE PATTERNS OF CHAOS by John Briggs (Simon & Schuster Touchstone Books 1992). The image is by Mario Markus, a physicist at the Max Planck Institute in Dortmund, Germany. This is the first such picture I've ever seen, and I'd love to see more. I've written Mario Markus but haven't heard back yet. Does anyone know anything more about this picture or about other pictures of 3D CAs? From cellular-automata-request@Think.COM Sat Jan 2 00:28:52 1993 Received: by mail.think.com; Sat, 2 Jan 93 00:28:55 -0500 Return-Path: Received: from Think.COM by mail.think.com; Sat, 2 Jan 93 00:28:52 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Sat, 2 Jan 93 00:28:46 EST Message-Id: <9301020528.AA23398@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 3376; Fri, 01 Jan 93 23:29:10 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 3375; Fri, 01 Jan 93 23:29:09 MEX Date: Fri, 01 Jan 93 23:27:01 MEX From: "Harold V. McIntosh" Subject: 3-d ZB's. To: "(Cellular Automata)" Rudy Ruckler comments: > > There is a lovely photo of a 3D Belusov-Zhabotinsky type CA (scrolls) > on p. 111 of the coffee-table paperback FRACTALS THE PATTERNS OF CHAOS > by John Briggs (Simon & Schuster Touchstone Books 1992). The image > ... > By pure chance a copy of the June, 1974 issue of Scientific American is sitting here beside the machine; the cover picture is entitled 'Rotating Chemical Reactions,' illustrating Arthur T. Winfree's article on pages 82-95. Among other things he discusses the forms that the famous spirals might take in three dimensions. - Picturing any kind of 3-d automata on PC-level equipment is something of a challenge, but there must be some interesting rewards for those who manage to do so; this is evidently one of them. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Sat Jan 2 07:27:12 1993 Received: by mail.think.com; Sat, 2 Jan 93 07:27:15 -0500 Return-Path: <100020.2727@compuserve.com> Received: from Think.COM by mail.think.com; Sat, 2 Jan 93 07:27:12 -0500 Received: from ihb.compuserve.com by Early-Bird.Think.COM; Sat, 2 Jan 93 07:27:10 EST Received: by ihb.compuserve.com (5.65/5.910516) id AA01988; Sat, 2 Jan 93 07:27:08 -0500 Date: 02 Jan 93 07:23:39 EST From: Andrew Wuensche <100020.2727@CompuServe.COM> To: CA list Subject: evolving CAs Message-Id: <930102122339_100020.2727_EHF16-1@CompuServe.COM> Evolving CAs ------------ A program for mutating and evolving 1-d, 5 neighbour CA rules is part of the software included with my book "The Global Dynamics of Cellular Automata"*. As the CA's space-time pattern generates, a key press will flip one bit at a random position in the 32 bit rule table (another key flips back if the result does not look promising, other keys reset the CA's state). Using this method of random mutation and artificial selection without stopping the CA, I have evolved many examples of "complex rules" (with interacting gliders, glider guns etc) supposed to be rare in rule space. * "THE GLOBAL DYNAMICS OF CELLULAR AUTOMATA, An Atlas of Basin of Attraction Fields of One-Dimensional Cellular Automata" Andrew Wuensche and Mike Lesser, (PC diskette included) foreword by Christopher Langton. Santa Fe Institute Studies in the Sciences of Complexity, Reference Vol 1, Addison-Wesley, Reading MA, phone:(800) 447 2226, IBSN 0-201-55740-1 1992 Hardcover, 250 pages, $53.75 Andrew Wuensche contact address: Santa Fe Institute and 48 Esmond Road, London W4 1JQ University of Sussex tel 081 995 8893, fax 081 742 2178 wuensch@santafe.edu email 100020.2727@compuserve.com From cellular-automata-request@Think.COM Sat Jan 2 10:58:37 1993 Received: by mail.think.com; Sat, 2 Jan 93 10:58:39 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sat, 2 Jan 93 10:58:37 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sat, 2 Jan 93 10:58:35 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA03618; Sat, 2 Jan 93 10:21:26 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 2 Jan 1993 14:37:49 GMT From: heitkoet@lusty.informatik.uni-dortmund.de (Joerg Heitkoetter) Organization: CS Department, Dortmund University, Germany Subject: Re: 3D BZ Message-Id: <1i49btINNs0h@fbi-news.Informatik.Uni-Dortmund.DE> Newsgroups: comp.theory.cell-automata References: <199301012150.AA20881@sjsumcs.SJSU.EDU> Sender: ca-request@Think.COM To: ca@Think.COM In article <199301012150.AA20881@sjsumcs.SJSU.EDU>, rucker@sjsumcs.SJSU.EDU (Rudy Rucker) writes: |> |> There is a lovely photo of a 3D Belusov-Zhabotinsky type CA (scrolls) |> on p. 111 of the coffee-table paperback FRACTALS THE PATTERNS OF CHAOS |> by John Briggs (Simon & Schuster Touchstone Books 1992). The image |> is by Mario Markus, a physicist at the Max Planck Institute in |> Dortmund, |> Germany. Well that's my old working group, the biomathematics research group ;-) It seems that every book on chaos, etc. gets a picture of our little institute: eg. the German version of Paul Davis' book also carries a 3D picture of the BZ reaction, but of a different numerical model. |> This is the first such picture I've ever seen, and I'd love |> to see more. I've written Mario Markus but haven't heard back yet. Try to reach him by email: markus@mpi-dortmund.mpg.dbp.de should should work...if you do not succeed he might be visiting his hometown: Santiago de Chile (he is Chilean). The Institut has neither a News feed, nor a properly set up finger(1) service, unfortunately. |> Does anyone know anything more about this picture or about other pictures |> of 3D CAs? One of the first was introduced by A.K. Dewdney in Scientific American, by Charter Bayon a 3D version of life(1)...he also wrote an article on this in Complex Systems, as far as I remember. In article MCINTOSH@unamvm1.dgsca.unam.mx ("Harold V. McIntosh") writes: |> Picturing any kind of 3-d automata on PC-level equipment is something of |> a challenge, but there must be some interesting rewards for those who manage |> to do so; this is evidently one of them. As stated above: this will not be the picture of a cellular-automaton, but of a numerical model. The original program of Charter Bay ran and displayed it's state on a Macintosh. Mario's picture was probably computed using the MPI's compute server: a CONVEX 20xx Supermini... -joke -- Joerg Heitkoetter Systems Analysis Group University of Dortmund, Germany (joke@ls11.informatik.uni-dortmund.de). From cellular-automata-request@Think.COM Sat Jan 2 15:19:43 1993 Received: by mail.think.com; Sat, 2 Jan 93 15:19:45 -0500 Return-Path: Received: from Think.COM by mail.think.com; Sat, 2 Jan 93 15:19:43 -0500 Received: from Sunburn.Stanford.EDU by Early-Bird.Think.COM; Sat, 2 Jan 93 15:19:41 EST Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08281; Sat, 2 Jan 93 12:19:39 -0800 Date: Sat, 2 Jan 93 12:19:39 PST From: John Koza To: ca@Think.COM Subject: Evolving CAs using Genetic Programming Message-Id: Cellular automata rules can be evolved via genetic programming. Examples of 1-D and 2-R evolutions are contained in my new book on genetic programming. Information about book follows... BOOK AND VIDEOTAPE ON GENETIC PROGRAMMING A new book and a one-hour videotape (in VHS NTSC, PAL, and SECAM formats) on genetic programming are now available from the MIT Press. NEW BOOK... GENETIC PROGRAMMING: ON THE PROGRAMMING OF COMPUTERS BY MEANS OF NATURAL SELECTION by John R. Koza, Stanford University The recently developed genetic programming paradigm provides a way to genetically breed a computer program to solve a wide variety of problems. Genetic programming starts with a population of randomly created computer programs and iteratively applies the Darwinian reproduction operation and the genetic crossover (sexual recombination) operation in order to breed better individual programs. The book describes and illustrates genetic programming with 81 examples from various fields. 840 pages. 270 Illustrations. ISBN 0-262-11170-5. Contents... 1 Introduction and Overview 2 Pervasiveness of the Problem of Program Induction 3 Introduction to Genetic Algorithms 4 The Representation Problem for Genetic Algorithms 5 Overview of Genetic Programming 6 Detailed Description of Genetic Programming 7 Four Introductory Examples of Genetic Programming 8 Amount of Processing Required to Solve a Problem 9 Nonrandomness of Genetic Programming 10 Symbolic Regression - Error-Driven Evolution 11 Control - Cost-Driven Evolution 12 Evolution of Emergent Behavior 13 Evolution of Subsumption 14 Entropy-Driven Evolution 15 Evolution of Strategy 16 Co-Evolution 17 Evolution of Classification 18 Iteration, Recursion, and Setting 19 Evolution of Constrained Syntactic Structures 20 Evolution of Building Blocks 21 Evolution of Hierarchies of Building Blocks 22 Parallelization of Genetic Programming 23 Ruggedness of Genetic Programming 24 Extraneous Variables and Functions 25 Operational Issues 26 Review of Genetic Programming 27 Comparison with Other Paradigms 28 Spontaneous Emergence of Self-Replicating and Self-Improving Computer Programs 29 Conclusions Appendices contain simple software in Common LISP for implementing experiments in genetic programming. ONE-HOUR VIDEOTAPE... GENETIC PROGRAMMING: THE MOVIE by John R. Koza and James P. Rice, Stanford University The one-hour videotape (in VHS NTSC, PAL, and SECAM formats) provides a general introduction to genetic programming and a visualization of actual computer runs for 22 of the problems discussed in the book GENETIC PROGRAMMING: ON THE PROGRAMMING OF COMPUTER BY MEANS OF NATURAL SELECTION. The problems include symbolic regression, the intertwined spirals, the artificial ant, the truck backer upper, broom balancing, wall following, box moving, the discrete pursuer-evader game, the differential pursuer- evader game, inverse kinematics for controlling a robot arm, emergent collecting behavior, emergent central place foraging, the integer randomizer, the one-dimensional cellular automaton randomizer, the two-dimensional cellular automaton randomizer, task prioritization (Pac Man), programmatic image compression, solving numeric equations for a numeric root, optimization of lizard foraging, Boolean function learning for the 11-multiplexer, co- evolution of game-playing strategies, and hierarchical automatic function definition as applied to learning the Boolean even-11- parity function. ---------------------------ORDER FORM---------------------- PHONE: 1-800-356-0343 TOLL-FREE or 617-625-8569 MAIL: The MIT Press, 55 Hayward Street, Cambridge, MA 02142 FAX: 617-625-9080 Please send ____ copies of the book GENETIC PROGRAMMING: ON THE PROGRAMMING OF COMPUTERS BY MEANS OF NATURAL SELECTION by John R. Koza (KOZGII) (ISBN 0-262-11170-5) @ $55.00. ____ copies of the one-hour videotape GENETIC PROGRAMMING: THE MOVIE by John R. Koza and James P. Rice in VHS NTSC format (KOZGVV) (ISBN 0-262-61084-1) @$34.95 ____ copies of the videotape in PAL format (KOZGPV) (ISBN 0-262- 61087-6) @$44.95 ____ copies of the videotape in SECAM format (KOZGSV) (ISBN 0- 262-61088-4) @44.95. Name __________________________________ Address_________________________________ City____________________________________ State_________________Zip________________ Country_________________________________ Phone Number ___________________________ $ _______ Total $ _______ Shipping and Handling ($3 per item. Outside U.S. and Canada, add $6 per item for surface rate or $22 per item for airmail) $ _______ Canada - Add 7% GST $ _______ Total due MIT Press __ Payment attached (check payable to The MIT Press in U.S. funds) __ Please charge to my VISA or MASTERCARD credit card Number ________________________________ Credit Card Expires _________________________________ Signature ________________________________ From cellular-automata-request@Think.COM Sat Jan 2 22:58:44 1993 Received: by mail.think.com; Sat, 2 Jan 93 22:58:47 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sat, 2 Jan 93 22:58:44 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sat, 2 Jan 93 22:58:42 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA20415; Sat, 2 Jan 93 22:35:47 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Sun, 3 Jan 1993 03:29:03 GMT From: ninassup@athena.mit.edu (Nikos I Nassuphis) Organization: Massachusetts Institute of Technology Subject: WireWorld Message-Id: <1993Jan3.032903.339@athena.mit.edu> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM I just finished implementation of WireWorld, and I wonder if there are any interesting circuits out there that I could try it on... Thanx NN ninassup@athena.mit.edu From cellular-automata-request@Think.COM Sun Jan 3 23:45:11 1993 Received: by mail.think.com; Sun, 3 Jan 93 23:45:13 -0500 Return-Path: Received: from Think.COM by mail.think.com; Sun, 3 Jan 93 23:45:11 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Sun, 3 Jan 93 23:45:04 EST Message-Id: <9301040445.AA20227@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 4340; Sun, 03 Jan 93 22:45:35 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 4339; Sun, 03 Jan 93 22:45:34 MEX Date: Sun, 03 Jan 93 22:42:55 MEX From: "Harold V. McIntosh" Subject: WireWorld circuitry. To: "(Cellular Automata)" Nikos I Nassuphis inquires: - > I just finished implementation of WireWorld, and I wonder > if there are any interesting circuits out there that I > could try it on... - If anyone recalls Peter Rony's BugBooks from early microcomputer days, they are full of simple circuitry. A word of warning: IC's are based on NAND gates, whereas WireWorld seems to work better with NOR gates. So you get to reinvent the wheel (microcircuitry) all over again. - The closest Wireworld comes to boolean constants are pulse trains, so the place to begin is first with clocks, then with the traditional boolean functions, finally create delays, and crossovers. From then on, it is just one huge construction project. - Some simple, but cute circuits: - 1) an electron mirror - sends a single pulse back where it came from. 2) single pulser - only lets the first pulse of a train get through. 3) pulse doubler - emits two pulses for each arrival. 4) train trigger - emits continuous pulses once triggered. - After that, there is the whole family of flip-flops (D, J, K, ...), binary counters, incrementers, adders, ... (even your own Intel 8080). - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Tue Jan 5 01:59:11 1993 Received: by mail.think.com; Tue, 5 Jan 93 01:59:14 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 5 Jan 93 01:59:11 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 5 Jan 93 01:59:08 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA08940; Tue, 5 Jan 93 01:52:01 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Tue, 5 Jan 1993 05:53:57 +0000 From: paulf@manor.demon.co.uk (Paul Fawcett) Organization: UDI Subject: Biologically Plausible Dynamic Artificial Neural Networks Message-Id: <726213237snz@manor.demon.co.uk> Newsgroups: comp.ai,comp.ai.neural-nets,sci.cognitive,comp.theory.cell-automata,bionet.neuroscience,bionet.molbio.evolution,bionet.software Sender: ca-request@Think.COM To: ca@Think.COM Biologically Plausible Dynamic Artificial Neural Networks. ----------------------------------------------------------- A *Dynamic Artificial Neural Network* (DANN) [1] possesses processing elements that are created and/or annihilated, either in real time or as some part of a development phase [2]. Of particular interest is the possibility of constructing *biologically plausible* DANN's that models developmental neurobiological strategies for establishing and modifying processing elements and their connections. Work with cellular automata in modeling cell genesis and cell pattern formation could be applicable to the design of DANN topologies. Likewise, biological features that are determined by genetic or evolutionary factors [3] would also have a role to play. Putting all this together with a view to constructing a working DANN, possessing cognitive/behavioral attributes of a biological system is a tall order; the modeling of nervous systems in simple organisms may be the best approach when dealing with a problem of such complexity [4]. Any comments, opinions or references in respect of the above assertions would be most welcome. Many thanks Paul Fawcett. University of Westminster References. 1. Ross, M. D., et al (1990); Toward Modeling a Dynamic Biological Neural Network, Mathl Comput. Modeling, Vol 13 No.7, pp97-105. 2. Lee, Tsu-Chang,(1991); Structure Level Adaptation for Artificial Neural Networks, Kluwer Academic Publishers. 3. Edleman, Gerald,(1987); Neural Darwinism the Theory of Neural Group Selection, Basic Books. 4. Beer, Randal, D,(1990); Intelligence as Adaptive Behavior : An Experiment in Computational Neuroethology. Academic Press. -- -------------------------------------------------------------------------- Paul Fawcett | Internet: paulf@manor.demon.co.uk London, UK. | tenec@westminster.ac.uk -------------------------------------------------------------------------- From cellular-automata-request@Think.COM Wed Jan 6 11:41:23 1993 Received: by mail.think.com; Wed, 6 Jan 93 11:41:29 -0500 Return-Path: Received: from Think.COM by mail.think.com; Wed, 6 Jan 93 11:41:23 -0500 Received: from sfi.santafe.edu by Early-Bird.Think.COM; Wed, 6 Jan 93 11:41:18 EST Received: from mule ([192.132.2.13]) by sfi.santafe.edu (4.1/SMI-4.1) id AA21309; Wed, 6 Jan 93 09:42:19 MST Received: from seldon.predict.com by mule (4.1/SMI-4.1) id AA01030; Wed, 6 Jan 93 09:41:03 MST Date: Wed, 6 Jan 93 09:41:03 MST From: n@predict.com@santafe.edu (Norman Packard) Message-Id: <9301061641.AA01030@mule> Received: by seldon.predict.com (4.1/SMI-4.1) id AA05155; Wed, 6 Jan 93 09:41:01 MST To: hurd@math.gatech.edu@santafe.edu Cc: ca@think.com@santafe.edu, rucker@sjsumcs.SJSU.EDU@santafe.edu, mm@santafe.edu Subject: [rucker@sjsumcs.SJSU.EDU: evolving cas] Reply-To: n%predict.com@santafe.edu Lyman, Thanks for the message. Regarding evolution of CA's, two points: -- Rucker correctly indicates that I wrote an article on evolution of a population 1D CA's with a fitness function that rewarded classification of initial conditions on the basis of the density of nonzero sites. Evolution was somewhat successful, though very time consuming (each computation of the fitness of each individual involved an average of many runs). Melanie Mitchell, now at the Santa Fe Institute (mm@santafe.edu), has recently been following up these experiments. One of her most interesting results is that one of my conclusions might be wrong. In particular, the conclution quoted in the title of my paper, "evolution toward the edge of chaos". Her experiments indicate that the peaking of the population near the edge of chaos that I observed is probably due to an artifact of the genetic algorithm I used (in particular, a diversity mechanism to throw evolution off local maxima). She has a paper coming out soon. -- Regarding "Blind Watchmaker" style evolution, below I enclose a proposal for a project that never happened. I envisioned it to take place somewhere like Disneyland. I am not sure that evolving CA's on the most microscopic level (entries in the rule table) would give enough access to aesthetic patterns to make the evolutionary game fun. Having knobs (genetic operators) control other more global properties of the CA (eg. densities of particular symbols in the rule table) might be good, or moving to variation of continuous parameters in a lattice map (CA with continuous variables at each site) might be good. Obviously, the same idea could work with any class of pattern generating dynamics. L-systems might be very good. Yours, Norman _______________________________________________________________________________ \documentstyle[12pt]{article} \begin{document} \title{Evolving Art\\ A Proposal for an Exhibit} \author{Norman H. Packard\\ via Montebello 30\\ 20121 Milan Italy} \date{April, 1989} \maketitle Recent research on evolving and adaptive systems suggests an idea for a large scale exhibit, suitable for a museum or other public display. The exhibit would have the following appealing features: (i) it is interactive, (ii) it is visually appealing, (iii) as people interact with it, the exhibit itself would constantly evolve, (iv) it would constitute an ongoing research project on a scale impossible to achieve any other way.\\ \ \\ The background for the idea comes from looking at adaptation in the space of cellular automaton (CA) rules. The essential idea of the exhibit is to use people's sense of aesthetics as the fitness function, and to use people interacting with the exhibit as food for a genetic algorithm that would create an evolutionary tree of cellular automata, which would become increasingly beautiful with time. \section*{Presentation} Roughly, my idea for the appearance of the exhibit would be to have one very large color monitor that would be the centerpiece of the exhibit and several other visually separate large color monitors (at least 12), showing the dynamics of the current population of two dimensional cellular automaton rules. Each rule will be simulated by special purpose hardware that presents a spectacular, constantly changing, complex two dimensional image on one of the monitors. In front of the monitors would be terminals for people to use, more than one, (a minimum of four should be sufficient) so that one person interacting with the exhibit could enhance others to try. Each terminal would have an interactive graphical interface, probably mouse driven with no keyboard, and also a color monitor to the side. The user would use the interface to choose members of the CA population, and use them experimentally to create new genetic varieties by mutation and crossover of them, seeing the results on the color monitor to the side. The large monitors would be divided into two rows. Participants would be able to put their entries into the population only on the bottom row, replacing an existing one of their choice. The top row could be read by the participants, but not altered. It would consist of the strongest rules in the population, where strength is measured by popularity... the more times a rule is selected for use, the stronger it becomes. Thus, if a rule on the bottom row is selected enough times, it may be moved up to the top row. The strongest rule in the population at any given time, would be presented on the largest, centerpiece color monitor. All the exhibit computers would have to be networked together for them to all participate in the same evolutionary experiment. The graphical interface could display the evolutionary tree of present rules, and trace through a rule's evolution, possibly allowing the user access to previously existing possibilities. A color printer could be available so that people could obtain a color output of their favorite rule (perhaps for a small fee to support the printer). \section*{Equipment} The best computation engine for this job is Toffoli's CAM. The advantages of the CAM are obvious, low price and very good performance when it comes to iterating cellular automata. The user interface should be on another machine. The software interface that comes with the CAM is much too sophisticated for museum use, and is not straightforwardly networked. The essential features for the user interface machine are (i) high resolution graphics (ii) software tools for a mouse driven graphics interface (iii) capability to be networked together easily. I have in mind some form of Unix workstation. \section*{Development} This would probably take six months to a year of concerted effort for two or three people. It would be essential to have both good software and hardware people. My rough estimate for the cost of both the development and the final equipment is \$200,000. \section*{Other Aspects} (i) Development costs might be split between more than one museum, with more than one final exhibit. The computers for each of the exhibits could be linked together to form a single large evolving system. (ii) The same basic idea of an evolving exhibit would also be applicable to other classes of photogenic dynamical systems. One possibility is L-systems, for which several versions of display software on personal computers are already available. \section*{Scientific Goals:} There are several fundamental questions that this exhibit might shed light on: (i) What are the characteristics of co-adaptive evolution? How fast does it take place? Does evolution happen in a continuous fashion, or with occasional large changes in the population? Is there any direction in the evolution, i.e. evolution toward rules with specific kinds of properties? (ii) What is the nature of aesthetics? Is there a well-defined "average" sense of aesthetics? Does the collective aesthetic tend toward images with well defined visual properties, or classes of properties? \section*{Images:} Below are example images generated by two-dimensional cellular automata. Naturally these are snapshots, and can only give a crude impression of what the dynamic images would look like. \end{document} From cellular-automata-request@Think.COM Wed Jan 6 18:59:53 1993 Received: by mail.think.com; Wed, 6 Jan 93 18:59:55 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from early-bird-1 by mail.think.com; Wed, 6 Jan 93 18:59:53 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Wed, 6 Jan 93 18:59:48 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA09917; Wed, 6 Jan 93 18:59:14 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Wed, 6 Jan 1993 22:41:07 GMT From: andrick@rhrk.uni-kl.de (Ulf Andrick [Biologie]) Organization: University of Kaiserslautern, Germany Subject: Re: Biologically Plausible Dynamic Artificial Neural Networks Message-Id: <1993Jan6.224107.27144@rhrk.uni-kl.de> Newsgroups: comp.ai,comp.ai.neural-nets,sci.cognitive,comp.theory.cell-automata,bionet.neuroscience,bionet.molbio.evolution,bionet.software References: <726213237snz@manor.demon.co.uk> Sender: ca-request@Think.COM To: ca@Think.COM paulf@manor.demon.co.uk (Paul Fawcett) writes: : : Biologically Plausible Dynamic Artificial Neural Networks. : ----------------------------------------------------------- Biologically Plausible Artificial Neural Network sounds to me a bit like an oxymoron. I tend to consider any `Artificial Neural Networks' as not biologically plausible. : : A *Dynamic Artificial Neural Network* (DANN) [1] : possesses processing elements that are created and/or : annihilated, either in real time or as some part of a : development phase [2]. : : Of particular interest is the possibility of : constructing *biologically plausible* DANN's that : models developmental neurobiological strategies for : establishing and modifying processing elements and their : connections. : : Work with cellular automata in modeling cell genesis and : cell pattern formation could be applicable to the design : of DANN topologies. Likewise, biological features that are : determined by genetic or evolutionary factors [3] would : also have a role to play. : Cellular automata? One might feel reminded of the Game of Life, where the cells change their state of being alive or dead according to the states of the neighbouring cells. If something like that is suggested, I feel somewhat skeptical if that is of use. I thought that the main issue of neurogenesis was the formation of synapses. That means, e. g., how do the neuronal processes find their way to their targets through a nascent entanglement of cells (not necessarily neurones, but also glia)? How is synaptic coupling changed in response to some stimulus? So, are your `cells' neurones, processes, synapses, or what? But perhaps you meant a concept of a cellular automaton so general that one might consider the use of the word as nearly meaningless. At least, the point seems to be a little mute to a person with some half-knowledge about cellular automata and neurogenesis. : Putting all this together with a view to constructing a : working DANN, possessing cognitive/behavioral attributes of : a biological system is a tall order; the modeling of nervous : systems in simple organisms may be the best approach when : dealing with a problem of such complexity [4]. There seems to be enough work to be done to simulate `static' Neural Networks in simple organisms. An interesting question is, e. g., what role the complex electrophysiological properties of the single neuron play for the behaviour of the whole network? What are the effects of neuromodulators? And these questions may also be of relevance in neural development. Artificial Neural Networks do hardly play any role in that kind of research, IMVHO, unless they have sophisticated neuronal properties, which most information scientists never dream of, but I wouldn't call such a model Artificial Network in order to distinguish it from much more primitive devices, which might be appropriate to describe spin glasses or whatever. As you can see, my view is that the Artificial Neural Network research is an engineering discipline detached from natural paradigmata, just as the whole AI. (As this is also crossposted to AI groups, I expect to have to put on my flame-proof suit.) : : Any comments, opinions or references in respect of the : above assertions would be most welcome. : : : Many thanks : : Paul Fawcett. : : University of Westminster : : : References. [deleted] -- Ulf R. Andrick andrick@rhrk.uni-kl.de FB Biologie - Tierphysiologie Universitaet Was du nicht selber weiszt, D-W 6750 Kaiserslautern das muszt du dir erklaeren (Tegtmeier) -- Ulf R. Andrick andrick@rhrk.uni-kl.de FB Biologie - Tierphysiologie Universitaet Was du nicht selber weiszt, D-W 6750 Kaiserslautern das muszt du dir erklaeren (Tegtmeier) From cellular-automata-request@Think.COM Thu Jan 7 15:15:17 1993 Received: by mail.think.com; Thu, 7 Jan 93 15:15:23 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Thu, 7 Jan 93 15:15:17 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Thu, 7 Jan 93 15:15:13 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA09508; Thu, 7 Jan 93 14:43:38 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 7 Jan 93 18:10:00 GMT From: mark_a@cix.compulink.co.uk (Mark Atkinson) Subject: k Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM The evolving CA idea is very interesting.... One thing occurs to me about Packard's "Disneyworld" proposal - 2D CAs have a very strong propensity to either die out of descend into chaos (of the uninteresting type). As Langton et al. have shown, the "best" (here, aesthetic) rules are balanced procariously on the "edge of chaos". How are we proposing to constrict the ruleset(s) such that our evolving pattern does not die? Is the correspondence between aesthetics and balanced entropy sufficient to ensure the observer selection-driven evolution will ensure our pattern will not go too far off-track? Perhaps using a class of CA which is less prone to these possiblities would be the answer. Any usual 8SUM (Toffoli's terminology) rule (even a very well-balanced one, like Conway's Life) would tend to stabilise after some time due the inevitable increase or decrease in its entropy level. I would propose using a time-reversible rule to avoid these problems. On the side of the genetic algorithm (GA), careful attention should be paid to the schema; that is to say, no small number of selections (which could potentially be contrived or even malicious here) should cause the pattern to diverge drastically from its current state. The evolution must proceed in very small steps if it is to achieve good results, but no so small as the users to not see feedback within their short attention span. There is a difficult dilemma here. On the "alternatives" front, IFS codes (Iterated Function Systems) are a good bet - aesthetically pleasing, small codes giving rise to complex structures, robust/similar under mutation/recombination. On the minus side, they use real numbers, but this isn't too much of an issue. I have written a "Blind Watchmaker" type selector for IFS patterns, and the results _are_ nice. ============================================================================= Mark Atkinson mark_a@cix.compulink.co.uk ----------------------------------------------------------------------------- "This statement is true, but you cannot prove it." - Kurt Godel. My opinions are shareware - if you like them, please fax me $25. ============================================================================= >>>MATRIX version 1.21c From cellular-automata-request@Think.COM Fri Jan 8 04:14:39 1993 Received: by mail.think.com; Fri, 8 Jan 93 04:14:41 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Fri, 8 Jan 93 04:14:39 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Fri, 8 Jan 93 04:14:37 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA00424; Fri, 8 Jan 93 03:46:25 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 7 Jan 93 15:35:42 GMT From: roger@triplex.socal.com (Roger Knobbe) Organization: ICS Triplex, Torrance CA Subject: Re: WireWorld circuitry. Message-Id: <231@triplex> Newsgroups: comp.theory.cell-automata References: <9301040445.AA20227@Early-Bird.Think.COM> Sender: ca-request@Think.COM To: ca@Think.COM In article <9301040445.AA20227@Early-Bird.Think.COM> MCINTOSH@unamvm1.dgsca.unam.mx ("Harold V. McIntosh") writes: >Nikos I Nassuphis inquires: >- >> I just finished implementation of WireWorld, and I wonder >> if there are any interesting circuits out there that I >> could try it on... >- >The closest Wireworld comes to boolean constants are pulse trains, so the >place to begin is first with clocks, then with the traditional boolean Ok, I figured out a couple of simple oscillators, e.g. - =#= - with a period of 3, and - = # = with a period of 4. >functions, finally create delays, and crossovers. From then on, it is just and I figured out delays (sort of) by just varying the lengths of wire from various contacts on a clock to get 3 staggered pulses from a single oscillator. However, I haven't figured out the more sophistcated circuits, yet. Can anybody give me some tips? Is there a better wire-world than the wire-pc.c program that shows up on archie? rog. From cellular-automata-request@Think.COM Fri Jan 8 18:15:48 1993 Received: by mail.think.com; Fri, 8 Jan 93 18:15:51 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Fri, 8 Jan 93 18:15:48 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Fri, 8 Jan 93 18:15:16 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA21482; Fri, 8 Jan 93 17:28:56 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Fri, 8 Jan 1993 21:27:59 GMT From: hmasum@alfred.ccs.carleton.ca (Hassan Masum) Organization: Carleton University Subject: 1D computation-universal CAs Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM What classes of 1-dimensional CAs have been shown to be capable of supporting universal computers? I've read about 2 or 3 specific examples, but I'm more interested in any general results. Also it would be nice to know the 'simplest' 1D CA so far discovered with this property. Any answers, pointers, etc welcome! -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Hassan Masum...hmasum@ccs.carleton.ca "Artificial Intelligence Beats Real Stupidity" - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - From cellular-automata-request@Think.COM Fri Jan 8 19:56:37 1993 Received: by mail.think.com; Fri, 8 Jan 93 19:56:41 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 8 Jan 93 19:56:37 -0500 Received: from itesocci.gdl.iteso.mx by Early-Bird.Think.COM; Fri, 8 Jan 93 19:56:33 EST Received: by itesocci.gdl.iteso.mx (4.1/SMI-4.1) id AA10927; Fri, 8 Jan 93 18:57:45 CST Date: Fri, 8 Jan 93 18:57:45 CST From: a18672@itesocci.gdl.iteso.mx (Burgos Qui#onez Jesus Mariano) Message-Id: <9301090057.AA10927@itesocci.gdl.iteso.mx> To: ca@Think.COM Subject: A dude...! Hi there: I am studying computing science, i am in this list but i don't know what exactly it is, i learned about automatas but cellular automata ? Can somebody explain this to me ? The think is that it sounds so interes- ting. Thanks. Vurghoz. a18672@itesocci.bitnet a18672@itesocci.gdl.iteso.mx From cellular-automata-request@Think.COM Fri Jan 8 22:31:07 1993 Received: by mail.think.com; Fri, 8 Jan 93 22:31:09 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 8 Jan 93 22:31:07 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Fri, 8 Jan 93 22:30:58 EST Message-Id: <9301090330.AA10627@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 4603; Fri, 08 Jan 93 21:31:27 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 4596; Fri, 08 Jan 93 21:31:26 MEX Date: Fri, 08 Jan 93 21:26:47 MEX From: "Harold V. McIntosh" Subject: Wire World. To: "(Cellular Automata)" Roger Knobbe says: > > However, I haven't figured out the more sophistcated circuits, yet. Can > anybody give me some tips? Is there a better wire-world than the wire-pc.c > program that shows up on archie? - Not knowing wire-pc.c it is hard to say what's better. But CellMaster is good] - - Sintar Software - 1001 4th Avenue, Suite 3200 (data valid in 1990) - Seattle, Washington 98154 - (206) 625-1213 - Very helpful is the screen editor which is included. - In any program, it is a good idea to build up tiles which can be traversed in one clock period. A period 6 clock is conservative. - - ....... - ..oo... - .o..ooo an electron head at the extreme left - ..oo... enters a tile to the right each 6 ticks. - ....... - - ...... - ...o.. a barrier. electron head entering either side - oooooo gets stopped cold. - ...o.. - ...... - - ...... - ..oo.. a diode. electron head entering left emerges - ooo.oo on right six ticks later, but one entering right - ..oo.. gets stopped. - ...... - - .......c - ......o (a and not b) gate. A fundamental construct. the - .....o. electron arrives at c 6 ticks later if a=1; b=0; - ..o.o.. any other initial combination and nothing emerges. - booo... - ..o.o.. - .....a. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Fri Jan 8 22:49:24 1993 Received: by mail.think.com; Fri, 8 Jan 93 22:49:29 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 8 Jan 93 22:49:24 -0500 Received: from sjsumcs.SJSU.EDU by Early-Bird.Think.COM; Fri, 8 Jan 93 22:49:22 EST Received: by sjsumcs.SJSU.EDU (5.65c/IDA-1.4.4) id AA21247; Fri, 8 Jan 1993 19:49:57 -0800 Date: Fri, 8 Jan 1993 19:49:57 -0800 From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker) Message-Id: <199301090349.AA21247@sjsumcs.SJSU.EDU> To: ca@Think.COM Subject: RE: "A dude...!" There should be a software method for simple access to a FAQ (frequently asked question) list such as "What is a CA?" But I'll try an answer. A CA (cellular automaton) is a *parallel* computation characterized by being i) homogeneous (each of the parallel processors has the same data-intake pattern, the same algorithm, and the same data-output channel) ii) parallel (meaning that there are lots of the processing or computing sites. Ordinarily "parallel" is taken to mean "synchronistic" as well,menaing that all the parallel sites update at the same times. Everybody inhales, everybody thinks, everybody exhales.) iii) local ( the data-intake, or inhale, only draws information from a finite number of other processors in the CA). This definition appear in Margolus and Toffoli's CELLULAR AUTOMATON MACHINES and in my CA LAB MANUAL. I'm not entirely sure its the best possible definition. One assumption implicit in the ordinary idea of a CA is that the sites stay spatially fixed. Something I wonder about is whether a moving alife program such as vants, turmites, sims, critters, bugs etc. might not also be thought of as a CA in a general sense. From cellular-automata-request@Think.COM Sat Jan 9 22:17:32 1993 Received: by mail.think.com; Sat, 9 Jan 93 22:17:34 -0500 Return-Path: Received: from Think.COM by mail.think.com; Sat, 9 Jan 93 22:17:32 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Sat, 9 Jan 93 22:17:25 EST Message-Id: <9301100317.AA01184@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 6207; Sat, 09 Jan 93 21:17:56 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 6206; Sat, 09 Jan 93 21:17:54 MEX Date: Sat, 09 Jan 93 21:11:59 MEX From: "Harold V. McIntosh" Subject: Universal Cellular Automata. To: "(Cellular Automata)" Hassan Masum asks: > > What classes of 1-dimensional CAs have been shown to be capable of > supporting universal computers? I've read about 2 or 3 specific > examples, but I'm more interested in any general results. Also it > would be nice to know the 'simplest' 1D CA so far discovered with this > property. > That depends somewhat on how you define a universal computation. If you follow Turing's line of thought, that you have a specific algorithm or process or concept that you call computation in mind, and then set out to design a mechanism which will realize that computation, then you have one point of view. - On the other hand if you have some natural (or artificial) phenomonon which either looks or is provably complicated, you may conclude that you need an artifact at least as complicated as Turing's Universal Computer to analyze it. You might then say that your phenomonon was participating in a univerasl computation, or performing one, or whatever. - Taking the first point of view, it is not hard to conjure up a one dimensional cellular automaton which follows the lines of Turing's original design; this was already done back around the fifties, as von Neumann's ideas about cellular automata began to circulate. - There is also a famous result of Shannon, concerning the tradeoff between states and symbols in a Turing machine, whence one concludes that their product ought to be constant, whose minimal value has been a result of a certain amount of speculation. Marvin Minsky discusses the issue in his book, 'Computation: Finite and Infinite Machines.' - In recent times attention has again been paid to the issue. Karel Culick III and collaborators have discussed some tradeoffs in cellular automata, wherein the size of a neighborhood may be compensated by an increase in states. Other authors have pondered such issues as the effect of an infinite number of read heads on the automaton, or of guaranteeing an infinite supply of tape. - Specific results would not seem to go much beyond those reported by Minsky. In general, even a radius 1/2 automaton can model a Turing Machine, but the Universal Machine needs a certain minimum of states, whose exact value is not known. - If a cellular automaton cannot be modelled on a Turing Machine that is only because it operates in parallel and is infinite. So if you want to suggest that cellular automata are more powerful than Turing Machines, you are talking about models of infinity and may have an opportunity to do something original. Otherwise Turing's thesis, or Church's thesis, or whatever, is that everything that we are accustomed to call computing, can be modelled on a Turing Machine. - Stephen Wolfram, among others, has poetically referred to processes performing 'universal computations,' and we come to the second point of view mentioned above. But, in a supplement to one of A.K. Dewdney's articles in Scientific American, he states that to establish the universality of a cellular automaton it would be necessary to relate its activity to a Turing Machine, or some other model which has been shown equivalent. - One of these would be a Post Tag System, whose equivalence was established by Minsky; there is also Minsky's Register Machine, which was used by Berlecamp, Conway and Guy to prove Life universal. And of course, WireWorld would let you build a General Purpose Computer, although maybe it wouldn't have infinite memory. - Of course, you could always show that a given automaton was NOT universal by solving its halting problem. That usually takes care of very, very small automata. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Mon Jan 11 11:15:23 1993 Received: by mail.think.com; Mon, 11 Jan 93 11:15:27 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 11 Jan 93 11:15:23 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 11 Jan 93 11:15:17 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA15157; Mon, 11 Jan 93 10:23:28 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Mon, 11 Jan 1993 14:01:08 GMT From: andrick@sun.rhrk.uni-kl.de (Ulf Andrick [Biologie]) Organization: University of Kaiserslautern, Germany Subject: Re: Biologically Plausible Dynamic Artificial Neural Networks Message-Id: <1993Jan11.140108.8022@rhrk.uni-kl.de> Newsgroups: comp.ai,comp.ai.neural-nets,sci.cognitive,comp.theory.cell-automata,bionet.neuroscience,bionet.molbio.evolution,bionet.software References: <1993Jan8.191256.28193@news.arc.nasa.gov> Sender: ca-request@Think.COM To: ca@Think.COM doshay@ursa.arc.nasa.gov (David Doshay) writes: : Because M.D. Ross was the first reference in the posting, and I work in her : lab at NASA Ames, I feel some need to post also. Dr. Ross is a neuroanatomist : and we study nerves in the vestibular macula at the ultrastructural level. : : First, I have never heard her refer to a DANN in the manner the post does, and in : the post she is referenced right after this acronym. : : Second, with respect to Ulf's posting, we do use both artificial neural net : models as well as electrophysiological models here in the Biocomputation : Center. There are some questions that are best answered with one of those models : because they are too hard to answer with the other type. We have far more time : in the 'real' models than the artificial, but some networking questions are : still best posed in the context of an artificial neural net just because of : the huge computational requirements for networks of more realistic nerves. We : are, however, scaling up our 'real' models to ask such questions. In those cases : we plan to burn several hundred hours of CRAY YMP time. Thank goodness (and the : US taxpayers) that NASA has the supercomputers. I just wanted to counter the view that Artificial Neural Networks (ANN) are suitable to explain everything in the brain. Further more, the posting I answered to referred to small neural systems in simple organisms, and here, I don't see a field for the application of ANN. I think of the stomatogastric ganglion of the crab or the flight generator of the locust when talking about small neural systems. I'm aware that some work has been done with ANNs to simulate large networks as in the human cortex. But I didn't mind to present a view which was perhaps a little one-sided, because I wanted to see the reactions, esp. of AI people. But somehow, there was not much response, at least I saw no other replies in bionet.neuroscience. : : These statements are mine, and not those of the Biocomputation Center : : David doshay@soma.arc.nasa.gov : : The thought police insist I tell you: : my thoughts, not NASA's -- Ulf R. Andrick andrick@rhrk.uni-kl.de FB Biologie - Tierphysiologie Universitaet Was du nicht selber weiszt, D-W 6750 Kaiserslautern das muszt du dir erklaeren (Tegtmeier) From cellular-automata-request@Think.COM Mon Jan 11 13:27:37 1993 Received: by mail.think.com; Mon, 11 Jan 93 13:27:41 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 11 Jan 93 13:27:37 -0500 Received: from sjsumcs.SJSU.EDU by Early-Bird.Think.COM; Mon, 11 Jan 93 13:27:31 EST Received: by sjsumcs.SJSU.EDU (5.65c/IDA-1.4.4) id AA14390; Mon, 11 Jan 1993 10:28:11 -0800 Date: Mon, 11 Jan 1993 10:28:11 -0800 From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker) Message-Id: <199301111828.AA14390@sjsumcs.SJSU.EDU> To: ca@Think.COM Subject: Packard's World I wonder what ever came of Norman Packard's 1989 proposal that a science museum set up an exhibit of CAs that evolve according to user selections. I guess it was turned down. The Boston Computer Museum does have a CAM-6 or two running CAs in an exhibit, and the Exploratorium in San Francisco has a machine running Life. In a museum context, the evolution would probably get trashed quickly by eight year olds beating around with the controls --- selecting a random rule 8 times in a row, etc. An alternate to breeding via lookup table crossovers would be to mimic what Karl Sims has been doing in breeding Lisp rule descriptions by turning the rules into parse trees that can be crossed by swapping branches --- this is a technique first used, I believe, by John Koza. If there were enough public interest in this kind of thing (which there isn't), one might even imagine a video-game style machine where people would *pay* to make CA selections and breed them. From cellular-automata-request@Think.COM Mon Jan 11 17:52:54 1993 Received: by mail.think.com; Mon, 11 Jan 93 17:52:59 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 11 Jan 93 17:52:54 -0500 Received: from hades.cshl.org by Early-Bird.Think.COM; Mon, 11 Jan 93 17:52:51 EST Received: by hades.cshl.org (5.57/Ultrix3.0-C) id AA19263; Mon, 11 Jan 93 17:52:44 -0500 Date: Mon, 11 Jan 93 17:52:44 -0500 From: wli@hades.cshl.org (Wentian Li) Message-Id: <9301112252.AA19263@hades.cshl.org> To: cellular-automata@Think.COM > >From cellular-automata-request@Think.COM Wed Jan 6 09:58:19 1993 >Received: from mail.think.com by sfi.santafe.edu (4.1/SMI-4.1) > id AA21801; Wed, 6 Jan 93 09:58:16 MST >Return-Path: >Date: Wed, 6 Jan 93 09:41:03 MST >>From: n@predict.com@santafe.edu (Norman Packard) >Message-Id: <9301061641.AA01030@mule> >Received: by seldon.predict.com (4.1/SMI-4.1) > id AA05155; Wed, 6 Jan 93 09:41:01 MST >To: hurd@math.gatech.edu@santafe.edu >Cc: ca@think.com@santafe.edu, rucker@sjsumcs.SJSU.EDU@santafe.edu, > mm@santafe.edu >Subject: [rucker@sjsumcs.SJSU.EDU: evolving cas] > > ..... > > -- Rucker correctly indicates that I wrote an article on evolution > of a population 1D CA's with a fitness function that rewarded > classification of initial conditions on the basis of the density > of nonzero sites. Evolution was somewhat successful, though very > time consuming (each computation of the fitness of each individual > involved an average of many runs). > > Melanie Mitchell, now at the Santa Fe Institute (mm@santafe.edu), > has recently been following up these experiments. One of her most > interesting results is that one of my conclusions might be wrong. > In particular, the conclution quoted in the title of my paper, > "evolution toward the edge of chaos". Her experiments indicate > that the peaking of the population near the edge of chaos that I > observed is probably due to an artifact of the genetic algorithm I > used (in particular, a diversity mechanism to throw evolution off > local maxima). She has a paper coming out soon. > > ..... it seems to solve a "puzzle" which bothered me for some time, that the final population in norman's experiment did not contain the target gacs-kurdurmov-levin rule which should have the best fitness by definition. the gacs-kurdurmov-levin rule has "lambda" value equal to 0.5, whereas the final population in norm's experiment peaked around the edge-of-chaos region with lambda near 0.2-0.3 or/and 0.7-0.8. my previous understanding (in my earlier posting in this groupo last april) was that the genetic algorithm didn't do a good job in selecting the final population. if the genetic algorithm does do a good job, then the final population will *not* converge to the edge of chaos region, but to wherever we want them to converge. then we have a situation of "adaptation towards the target region" instead of "adaptation towards the edge-of-chaos region wherever the target region is". the first one seems to be the case ... wentian li CSHL wli@cshl.org From cellular-automata-request@Think.COM Mon Jan 11 20:16:19 1993 Received: by mail.think.com; Mon, 11 Jan 93 20:16:22 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 11 Jan 93 20:16:19 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 11 Jan 93 20:16:13 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA02270; Mon, 11 Jan 93 20:04:59 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 11 Jan 93 23:31:01 GMT From: mab@wdl39.wdl.loral.com (Mark A Biggar) Organization: Loral Western Development Labs Subject: Re: 1D computation-universal CAs Message-Id: <1993Jan11.233101.5833@wdl.loral.com> Newsgroups: comp.theory.cell-automata References: Sender: ca-request@Think.COM To: ca@Think.COM In article hmasum@alfred.carleton.ca (Hassan Masum) writes: >What classes of 1-dimensional CAs have been shown to be capable of >supporting universal computers? I've read about 2 or 3 specific >examples, but I'm more interested in any general results. Also it >would be nice to know the 'simplest' 1D CA so far discovered with this >property. >Any answers, pointers, etc welcome! There is an obvious transformation of a N state by M symbol turing machine into a N+M state 1D CA with a neighbor of size 4. Most of the 1D CA is used to similate the turing machine tape with one cell simulating the turing machines head and internal state. All cells except the head cell and the cell imediately to its left and right are quiesent. Those two cell are active and only depend on the states of themselves, the cel to the left and the 2 cells to their right. Given the 7 state by 5 symbol universal turing machine in "Finite Machines" by Minsky, that shows the existence of a 12 state size 4 neighborhood 1D CA that is universal. You can get a CA with a neighborhood of size 3 by using (N+1)*M states, where again most of the CA simulates a tape, but one cell must encode both a tape space and the machine state. There are also methods of encoding a N state 1D CA into a binary 1D CA with a much larger neighborhood by using more then one cell in the new CA to simulate a cell in the original CA and expanding the neighborhood accordingly. For example, supose you have a 4 state 3 neighborhood 1D CA with states {A, B, C, D}. If we use the codes {000,100,010,001} to encode those states, we can lay out a CA like so: ...10ddd0110ddd0110ddd0110ddd0110ddd01... aaaaaaa bbbbbbbbbbbbbbbbbbb where the cells marked 'a' simulate a cell in the original CA, the 'd's are one of the above codes and the 'b's delineate the neighborhood. The sequence 0110, which cannot appear in any of the state encodings, acts as a registration mark to show where the simulated cells are. Using this method, the described universal 1D CA above, when transformed into a binary CA, would require a neighborhood size of 58 cells. -- Mark Biggar mab@wdl1.wdl.loral.com From cellular-automata-request@Think.COM Mon Jan 11 23:16:26 1993 Received: by mail.think.com; Mon, 11 Jan 93 23:16:29 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 11 Jan 93 23:16:26 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Mon, 11 Jan 93 23:16:19 EST Message-Id: <9301120416.AA21544@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 1476; Mon, 11 Jan 93 22:16:48 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 9376; Mon, 11 Jan 93 22:16:47 MEX Date: Mon, 11 Jan 93 21:18:22 MEX From: "Harold V. McIntosh" Subject: WireWorld AND. To: "(Cellular Automata)" Those who were looking for WireWorld hints might try to improve the following AND gate, which delivers its result in two clock cycles, or 12 ticks (this one doesn't need an explicit clock). - - ............... - .a...bxx....... - ..x.....xxx.... - ...x.x.x...x... - ....xxx....x... - .....x.x.x.x... - ........xxx.... - .........x.xxc. - ............... - Evidently, the identity used here is (a'b)'b = (a+b')b = ab + bb' = ab = c. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Wed Jan 13 07:15:57 1993 Received: by mail.think.com; Wed, 13 Jan 93 07:16:01 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Wed, 13 Jan 93 07:15:57 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Wed, 13 Jan 93 07:15:53 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA28430; Wed, 13 Jan 93 06:56:46 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 13 Jan 93 11:35:17 GMT From: mcrosbie@unix1.tcd.ie (Mark J. Crosbie) Organization: Trinity College, Dublin Subject: Where can I get Wireworld etc. Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM Hi all, I hope I'm not asking a FAQ here! I've been following the discussions on Wireworld and how to build a variety of gates in it. How do I get my hands on the source for Wireworld (preferably for a PC). I appreciate that there always is an ftp site somewhere, but I don't have ftp access. :-( I'm working on a project which involves building cellular machines which evolve to solve problems (the first being survival and reproduction in the first place). However, unlike the CA idea, my objects evolve independently of each other, based on a Classifier System as described in Goldberg's book "Genetic Algorithms in ...". My question is, has anyone done work in evolving systems where certain cells have to be brought together with other cells in order to work together to solve a problem, and how does one code this growth and placement requirement into the cells. This is obviously what happens when a human embryo grows: certain cells are brought into contact with other cells and they grow together to perform a function. A computing example would be (simple): Bringing 8 full-adders together to grow a 2x4-bit ripple-carry adder. I have started to address some of these problems in my project, but any input would be appreciated! Thanks in advance, Mark Crosbie mcrosbie@vax1.tcd.ie Dept. of Computer Science Trinity Colleg, Dublin Dublin 2 Eire. From liu@Think.COM Wed Jan 13 16:52:52 1993 Received: by mail.think.com; Wed, 13 Jan 93 16:52:55 -0500 Return-Path: Received: from Galaxy.Think.COM by mail.think.com; Wed, 13 Jan 93 16:52:52 -0500 Received: by galaxy.think.com (4.1/Think-1.0C) id AA03757; Wed, 13 Jan 93 16:52:51 EST Date: Wed, 13 Jan 93 16:52:51 EST Message-Id: <9301132152.AA03757@galaxy.think.com> From: Charlie Liu Sender: liu@Think.COM To: cellular-automata@Think.COM Subject: game of life program? A social science researcher at UIUC is interested in doing some cellular-automata type of simulations on the CM. He would like to see some codes, especially something called "game of life". We would really appreciate any help you could give us, like who wrote this code, how to get the code, any other similar codes. Thanks very much in advance. Charlie Liu From cellular-automata-request@Think.COM Wed Jan 13 22:39:17 1993 Received: by mail.think.com; Wed, 13 Jan 93 22:39:21 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Wed, 13 Jan 93 22:39:17 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Wed, 13 Jan 93 22:39:15 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA22317; Wed, 13 Jan 93 22:06:16 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 13 Jan 1993 23:42:11 GMT From: bailey_j@kosmos.wcc.govt.nz Organization: Wellington City Council (Public Access), Wgtn, Nz Subject: Simple CA's Message-Id: <1j29cjINNjnu@golem.wcc.govt.nz> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM I am a first year computer science student interested in CA's. Can anyone recommend (descriptions in email, please) some simple CA systems similiar to Conway's "Life ?" Thanks, much appreciated ! From cellular-automata-request@Think.COM Thu Jan 14 02:38:59 1993 Received: by mail.think.com; Thu, 14 Jan 93 02:39:02 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Thu, 14 Jan 93 02:38:59 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Thu, 14 Jan 93 02:38:56 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA28401; Thu, 14 Jan 93 01:47:38 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Thu, 14 Jan 1993 06:12:50 GMT From: ed@cwis.unomaha.edu (Ed Stastny) Organization: University of Nebraska at Omaha Subject: Graphically stunning CA's Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM After reading Rucker's raves about CA's in MONDO 2k's book, I began searching for some of the types of programs he spoke of. Not being all that persistant and probably not asking the right people, I only found a program called AAALIFE. It's nice...but not what I expected from Rucker's descriptions. Thus...I stumble in here and plop out the following... Could anyone point me towards a fairly recent and visually entertaining version of a CA? Something that's relatively quick, perhaps simple, colorful and mutating on the screen at all times. I'd like this for two reasons. One, I'm addicted to visuals...they make me smile. Two, I'm interested in learning about a-life and cellular automata and I figure having a program to putt around with would be a dandy beginning. All this on a PC...can it be done for an FTP a day? ...e -- || Ed Stastny......... editor/archiver qing bu-yao ba zhe-ke ye! || ed@cwis.unomaha.edu SOUND Magazine ke-yi qing ni ba zhe-zhang |||||||||||||||||||||| PO BX 31104 fang-da ma? x||||||||||||||||||||| Omaha, NE 68132 zhe bu-shi wo-de xie-zi... From cellular-automata-request@Think.COM Thu Jan 14 07:39:09 1993 Received: by mail.think.com; Thu, 14 Jan 93 07:39:13 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Thu, 14 Jan 93 07:39:09 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Thu, 14 Jan 93 07:39:07 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA07293; Thu, 14 Jan 93 06:52:50 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 14 Jan 93 11:38:22 GMT From: Benedict.M.Wightman@cm.cf.ac.uk (B M Wightman) Organization: University of Wales College of Cardiff Subject: Re: Where can I get Wireworld etc. Message-Id: <1993Jan14.113824.880@cm.cf.ac.uk> Newsgroups: comp.theory.cell-automata,comp.ai.genetic References: Sender: ca-request@Think.COM To: ca@Think.COM In comp.theory.cell_automata (I'm cross posting as it seems to be relevant to GAs as well...): In article mcrosbie@unix1.tcd.ie (Mark J. Crosbie) writes: >stuff deleted...> >I'm working on a project which involves building cellular machines >which evolve to solve problems (the first being survival and >reproduction in the first place). However, unlike the CA idea, >my objects evolve independently of each other, based on a Classifier >System as described in Goldberg's book "Genetic Algorithms in ...". > >My question is, has anyone done work in evolving systems where certain >cells have to be brought together with other cells in order to work >together to solve a problem, and how does one code this growth and >placement requirement into the cells. This is obviously what happens Holland did some work (and is still doing so?) on a system called Echo which apparently can evolve multicellular organisms - if anyone has any refs on this other than where I found it (in 'Adaptation in natural and artificial systems', 1992 edition), I would be very grateful if they'd let me know. As for using this on a CA to assemble blocks from smaller blocks, you'd first have to have some way of finding what a `useful` small block is, and how it can be connected to others (expressing the group of cells as some kind of macro). This was researched (I think) to a small extent by the people who discovered the Glider Gun in Life, headed by R.W.Gosper at M.I.T. - I'm not sure of the references here, but the article in Scientific American, entitled 'On cellular automata, the garden of eden and the game `life`' in the Mathematical Games column some years back is a start... >when a human embryo grows: certain cells are brought into contact >with other cells and they grow together to perform a function. I'm not entirely sure the biologists have worked this one out yet, let alone the Artificial evolution lobby... -- +----------------------------------------------------------------------+ | Benedict.M.Wightman@cm.cf.ac.uk / COMMA,Senghenydd Rd.,Cardiff,Wales | | PhD Student in Meddling In Things I Do Not Understand | | "I'm not aware of too many things, | | But I know what I know if you know what I mean" | +----------------------------------------------------------------------+ | Disclaimer: Everything you have ever been told is wrong. So is this. | +----------------------------------------------------------------------+ From cellular-automata-request@Think.COM Thu Jan 14 22:51:02 1993 Received: by mail.think.com; Thu, 14 Jan 93 22:51:10 -0500 Return-Path: Received: from Think.COM by mail.think.com; Thu, 14 Jan 93 22:51:02 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Thu, 14 Jan 93 22:50:55 EST Message-Id: <9301150350.AA25117@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 2453; Thu, 14 Jan 93 21:51:25 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 2452; Thu, 14 Jan 93 21:51:23 MEX Date: Thu, 14 Jan 93 21:49:13 MEX From: "Harold V. McIntosh" Subject: (LifeLike). To: "(Cellular Automata)" bailey_j(at)KOSMOS.WCC.GOVT.NZ asks: > >I am a first year computer science student interested in CA's. Can anyone >recommend (descriptions in email, please) some simple CA systems similiar to >Conway's Life ? Thanks, much appreciated ] > Conway's Life is pretty unique, for reasons that people are still trying to figure out. - When Life first became popular, a variant called 3-4 Life attracted some interest. A cell is lit up (or alive) only when either 3 or 4 neighbors, excluding itself, were alive in the previous generation. It shares many of the attractive features of Life, but its mobile structures aren't very versatile, and there are certain monsters (not very big, but ravenous) lying about waiting to devour the universe. - The number of self-complementary rules is much less than the number of general rules, but their evolution can be quite striking. Self-complementary means, the rule is the same when zeroes and ones are interchanged. - Over the years, a variety of automata have been extolled in messages that have been posted, so if you have access to the archives, you can go looking for them. As Rudy Rucker remarked the othr day, we could use an FAQ list. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Fri Jan 15 16:47:26 1993 Received: by mail.think.com; Fri, 15 Jan 93 16:47:28 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 15 Jan 93 16:47:26 -0500 Received: from gatech.edu by Early-Bird.Think.COM; Fri, 15 Jan 93 16:47:24 EST Received: from math.gatech.edu by gatech.edu (4.1/Gatech-9.1) id AA22450 for ca@think.com; Fri, 15 Jan 93 16:49:55 EST Received: by math.gatech.edu (4.1/SMI-4.1) id AA19022; Fri, 15 Jan 93 16:48:51 EST Date: Fri, 15 Jan 93 16:48:51 EST From: hurd@math.gatech.edu (Lyman Hurd) Message-Id: <9301152148.AA19022@math.gatech.edu> To: ca@Think.COM Subject: FAQ list Believe it or not I would like to put in a vote against a FAQ list. Cellular automata are sufficiently diverse that I think that the occasional naive question does us all good. If not relief is only a delete key away. Presumably we want to increase the number of people interested in CA and ``read the FAQ'' always manages to cool my interest in a subject. Lyman Hurd Iterated Systems, Inc. Norcross, GA 30092 From cellular-automata-request@Think.COM Fri Jan 15 17:55:56 1993 Received: by mail.think.com; Fri, 15 Jan 93 17:55:59 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Fri, 15 Jan 93 17:55:56 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Fri, 15 Jan 93 17:55:40 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA16862; Fri, 15 Jan 93 17:02:40 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Fri, 15 Jan 1993 17:54:19 GMT From: keller@jarthur.claremont.edu (Robert M. Keller) Organization: Harvey Mudd College, Claremont, CA 91711 Subject: HMC Symposium on Pattern Formation Message-Id: <1993Jan15.175419.26787@muddcs.claremont.edu> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM This message provides more detail on the HMC Symposium on Pattern Formation posted earlier. Harvey Mudd College SYMPOSIUM on PATTERN FORMATION February 12-13, 1993 The symposium will provide a focus on pattern formation from multidisciplinary vantage points, particularly on aspects of interest to biologists, computer scientists, mathematicians, and physical scientists. It will examine current questions in pattern formation within each of these fields and also with cross-disciplinary perspectives. The area of pattern formation includes formation of both natural and artificial cellular organisms, formation of patterns on and within these organisms, and space-time growth patterns. Of major concern is the formation of emergent patterns through the actions and interactions of many semi-autonomous units, none of which directs or has full knowledge of the overall process. Preliminary Program >>>>> Friday AM WELCOME 8:30am to 9:00am -- Beckman 124 INTRODUCTION Beckman Lecture Hall (Beckman 126) 9:00am -- noon 9:00 Bruce Boghosian Thinking Machines, Inc. correlations and pattern formation in cellular automata fluids. (Invited) 9:40 Leah Edelstein-Keshet University of British Columbia Theories of pattern formation based on short and long-ranged interactions. (Invited) 10:20 Break Beckman 124 10:50 Karel Culik II University of South Carolina Pattern generation based on fractals, automata and L-systems. (Invited) 11:30 Mei Zhu University of Washington Mechanisms for biological pattern formation -- nonlinear effects (Contributed) 11:45 Michael Lyons Caltech Nonlinear analysis of neural pattern formation models. (Contributed) 12:00 LUNCH Green Room (Platt Campus Center) >>>>> Friday PM APPLICATIONS I Beckman Lecture Hall (Beckman 126) 1:15pm to 4:05pm 1:15 David R. Soll University of Iowa The rhythmic behavior of cells in chemotactic waves during Dicytostelium Aggregation. (Invited) 1:55 John Gerhart Berkeley Axis formation in Xenopus embryos. (Invited) 2:35 Break Beckman 124 3:05 Peter Salamon San Diego State University Patterns in the distribution of complexity in naturally occurring genome sequences. (Contributed) 3:20 Marek Kimmel Rice University Emergence of stable DNA repeats from random sequences under unequal sister chromatid exchange. (Contributed) 3:35 Mark Millonas Los Alamos National Laboratory Swarm field dynamics and functional morphogenesis. (Contributed) 3:50 John O. Kessler University of Arizona Microbial consumption patterns. (Contributed) 4:15 WORKSHOP Bridging the theory/observation gap. 4:15pm to 5:15pm -- Beckman 126 RECEPTION and DINNER Reception begins at 6:00pm, Dinner at 6:30pm Green Room (Platt Campus Center) >>>>> Saturday AM MECHANISMS and ANALYSIS Beckman Lecture Hall (Beckman 126) 8:30 John R. Koza Stanford University Discovering cellular automata rules using genetic programming. (Invited) 9:10 Rik Belew UCSD Interposing a model of development between neural networks and genetic algorithms. (Invited) 9:50 Rob Shaw McArthur Fellow Transitions to turbulence in a reaction-diffusion system. (Invited) 10:30 Break Beckman 124 11:00 Stephanie Forrest University of New Mexico Emergent computation in the immune system. (Invited) 11:40 Kurt Fleischer Caltech Generating heterogeneous asymmetric artificial neural networks using developmental models. (Contributed) 11:55 LUNCH Green Room (Platt Campus Center) >>>>> Saturday PM APPLICATIONS II Beckman Lecture Hall (Beckman 126) 1:15 Scott Fraser CalTech Patterning of the developing brain: using intravital microscopy to follow cell lineages and axonal growth. (Invited) 1:55 Jonathan Roughgarden Stanford University Patterns in the ecology of barnacle populations from the California current system. (Invited) 2:35 Break Beckman 124 3:05 Sven Jakubith Berkeley Spontanous pattern formation during the oxidation of Carbon monoxide on single crystal platinum surfaces. (Contributed) 3:20 Andreas Herz Caltech Unexpected simplicity in spatio-temporal patterns in models for neural networks and population dynamics. (Contributed) 3:35 Paul H. Frankel USC Slow synapses and robust bursting patterns. (Contributed) 4:00 Panel on future directions 4:00pm to 5:00pm -- Beckman 126 5:00 End of Symposium ------------------------------------------------------------------------------- Requests for symposium attendance by faculty, researchers and students should be directed to one of the organizing committee listed below, stating the nature of interest. The number of participants is limited due to space constraints. A registration fee of $75 U.S. will be charged to defray costs. This fee will include two lunches and one dinner at the conference site. Lodging is available at Griswold's Inn, 555 W Foothill Blvd., Claremont. 909-626-2411 at the rate of $60 per night, including full buffet breakfast. A shuttle from the Ontario, CA airport (ONT) is provided by Griswold's. ------------------------------------------------------------------------------- Participants might also be interested in the following talk open to the public the evening before, as part of the dedication of the new F.W. Olin Science Center at Harvey Mudd College: The Computational Brain Professor Terry Sejnowski Howard Hughes Medical Institute, The Salk Institute for Biological Studies, and University of California, San Diego 7:00 pm, Thursday, February 11, 1993 Galileo Hall, 301 East Twelfth Street, Claremont, CA ------------------------------------------------------------------------------- Symposium Organizing Committee T.J. Mueller, Biology (chair) mueller@hmcvax.claremont.edu, 909-621-8561 Robert Keller, Computer Science keller@jarthur.claremont.edu, 909-621-8483 Robert Borrelli, Mathematics borrelli@hmcvax.claremont.edu, 909-621-8023 Stavros Busenberg, Mathematics busenberg@hmcvax.claremont.edu, 909-621-8023 Harvey Mudd College Claremont, CA 91711 Symposium advisory board Leah Edelstein-Keshet, University of British Columbia Scott Fraser, Caltech David Goldberg, University of Illinois J.D. Murray, University of Washington Clifford Pickover, IBM Watson Research Center From cellular-automata-request@Think.COM Sat Jan 16 00:05:49 1993 Received: by mail.think.com; Sat, 16 Jan 93 00:05:56 -0500 Return-Path: Received: from Think.COM by mail.think.com; Sat, 16 Jan 93 00:05:49 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Sat, 16 Jan 93 00:05:42 EST Message-Id: <9301160505.AA28771@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 7006; Fri, 15 Jan 93 23:06:13 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 7005; Fri, 15 Jan 93 23:06:09 MEX Date: Fri, 15 Jan 93 23:04:30 MEX From: "Harold V. McIntosh" Subject: Wireworld hints. To: "(Cellular Automata)" The following circuit has a period 6 clock in the upper left hand corner, ................ but it will emit just one pulse at the lower right ..tx............ although the clock keeps running. .h..xxxxx.xxx... ..xx.....x...x.. It is not a very exciting circuit, so someone should .........x...x.. provide it with a reset. Or it could be left almost .........x.x.x.. as it is, with the clock loop enlarged. The remainder ..........xxx... will reset itself if a clock period goes by without a .........x.x.... pulse. So, set up a chain of electrons at a multiple .........x...... of 6, and leave one of them out. ..........xxxxx. ................ How about the counterpart, in which the first incoming pulse sets the clock to ticking, but the second stops it again? - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Sat Jan 16 00:10:54 1993 Received: by mail.think.com; Sat, 16 Jan 93 00:10:59 -0500 Return-Path: Received: from Think.COM by mail.think.com; Sat, 16 Jan 93 00:10:54 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Sat, 16 Jan 93 00:10:44 EST Message-Id: <9301160510.AA28970@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 7013; Fri, 15 Jan 93 23:11:17 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 7012; Fri, 15 Jan 93 23:11:15 MEX Date: Fri, 15 Jan 93 23:07:14 MEX From: "Harold V. McIntosh" Subject: FAQ's. To: "(Cellular Automata)" Lyman Hurd tells us: > > Believe it or not I would like to put in a vote against a FAQ list. > Cellular automata are sufficiently diverse that I think that the occasional > naive question does us all good. If not, relief is only a delete key away. > Presumably we want to increase the number of people interested in CA and > ``read the FAQ'' always manages to cool my interest in a subject. > Well, I didn't really mean it that way, although it DID occur to me as I was posting my recent message that it might be so interpreted. - The thing is that one doesn't really mind trying to answer the questions that keep popping up, although it helps if several different people volunteer replies so that one can have different viewpoints. But it is also true that over the years we have accumulated many megabytes of questions and answers, and people should be made aware of this resource. On the other hand, it may be asking too much to expect every newcomer to go sifting through this mountain of material in the hope that there might be an answer to their Question lying there. Hence the FAQ list. - Would we agree that a person should feel offended if the ONLY reply to a Question were to be told ''to go chase the FAQ's?'' - This whole question may be rather academic, like .... who is going to put the bell on the cat? Making up such a list implies real work on somebody's part, and for MY part, I am pretty well inundated with trying to organize my own thoughts, and for me, unfortunately, indexing the CA Mail Archives lies rather much in the future. But I'm good at suggesting that someone else .... . - Lest anyone think we scorn curiosity, it might be worth repeating that we have several CA programs and reports which can be obtained by sending a complete mailing address (many people think everyone knows what country their favorite city or university is in) and requesting them. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Sun Jan 17 23:55:20 1993 Received: by mail.think.com; Sun, 17 Jan 93 23:55:22 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sun, 17 Jan 93 23:55:20 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sun, 17 Jan 93 23:55:16 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA21438; Sun, 17 Jan 93 22:57:16 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Sunday, 17 Jan 1993 18:12:31 IST From: Dan Gordon Organization: University of Haifa - Mt. Carmel Haifa, Israel. Subject: Re: Universal Cellular Automata. Message-Id: <93017.181231RSMA410@HAIFAUVM.BITNET> Newsgroups: comp.theory.cell-automata References: <9301100317.AA01184@Early-Bird.Think.COM> Sender: ca-request@Think.COM To: ca@Think.COM In article <9301100317.AA01184@Early-Bird.Think.COM>, MCINTOSH@unamvm1.dgsca.unam.mx ("Harold V. McIntosh") says: >Hassan Masum asks: >> What classes of 1-dimensional CAs have been shown to be capable of >> supporting universal computers? I've read about 2 or 3 specific >> examples, but I'm more interested in any general results. Also it >> would be nice to know the 'simplest' 1D CA so far discovered with this >> property. >> >-********** Material deleted ***************************** >Stephen Wolfram, among others, has poetically referred to processes performing >'universal computations,' and we come to the second point of view mentioned >above. But, in a supplement to one of A.K. Dewdney's articles in Scientific >American, he states that to establish the universality of a cellular automaton >it would be necessary to relate its activity to a Turing Machine, or some >other >model which has been shown equivalent. >-*********************************************************************** In reference to Wolfram's contributions, he defines the notion of a _totalistic_ cellular automaton, in which the state-transition function depends only on the sum of the states of the cell's neighborhood, and the sum includes the cell's own state. Each state is considered as a nonnegative integer, and the quiescent state is 0. Wolfram conjectured that even these simple cellular spaces are computation universal. Perhaps this is an example of what the first poster means by "simple" cellular automata. Note that the game of life is not totalistic: the transition function depends on the cell's own state and on the sum of the neighboring states. It has been shown that even 1-dimensional totalistic cellular automata are computation-universal, and this result proves Wolfram's conjecture. See: D. Gordon, "On the computational power of totalistic cellular automata," Mathematical Systems Theory, vol. 20 (1987), pages 43-52. From cellular-automata-request@Think.COM Mon Jan 18 07:55:18 1993 Received: by mail.think.com; Mon, 18 Jan 93 07:55:20 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 18 Jan 93 07:55:18 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 18 Jan 93 07:55:16 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA02212; Mon, 18 Jan 93 07:07:36 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Mon, 18 Jan 1993 12:03:15 GMT From: chen@crimson.gen.u-tokyo.ac.jp (U.Chen) Organization: Dept. of Nuclear Engineering, University of Tokyo, Japan Subject: test Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM --- test --------------------------------------------------------------------- Chen Yu "Jesus Christ died for everyone in this world!" Thermal Engineering Lab Department of Nuclear Engineering Faculty of Engineering Phone(Office): 03-3812-2111 The University of Tokyo ext. 6991 e-mail: chen@crimson.gen.u-tokyo.ac.jp Phone(Home): 03-3814-5925 ---------------------------------------------------------------------- From cellular-automata-request@Think.COM Mon Jan 18 10:55:45 1993 Received: by mail.think.com; Mon, 18 Jan 93 10:55:47 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 18 Jan 93 10:55:45 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 18 Jan 93 10:55:42 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA06051; Mon, 18 Jan 93 10:28:04 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 18 Jan 93 16:10:19 +0100 From: le9miiwa@cine88.cineca.it Organization: CINECA, Italian Interuniversity comp. centre Subject: Neural nets for rainfall forecasting? Message-Id: <1993Jan18.161019.662@cine88.cineca.it> Newsgroups: comp.theory.cell-automata,sci.geo.meteorology Sender: ca-request@Think.COM To: ca@Think.COM Hi Is anyone aware of applications of neural nets or cellular automata to rainfall forecasting? Any references on this subject are welcome. Please email to le9miiwa@cine88.cineca.it Thanks, ciao marco ========================================= Marco Lazzari ISMES - Div. Modelli Matematici viale Giulio Cesare, 29 I-24124 Bergamo ITALY tel.: +39 35 307330/1 fax : +39 35 211191 email le9miiwa@cine88.cineca.it ========================================= From cellular-automata-request@Think.COM Mon Jan 18 13:26:30 1993 Received: by mail.think.com; Mon, 18 Jan 93 13:26:35 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 18 Jan 93 13:26:30 -0500 Received: from email.tuwien.ac.at by Early-Bird.Think.COM; Mon, 18 Jan 93 13:26:23 EST Received: from vexpert.dbai.tuwien.ac.at by email.tuwien.ac.at (5.65b/1.34-MHS) id AA18019; Mon, 18 Jan 93 19:25:42 +0100 Received: from altair.dbai.tuwien.ac.at by vexpert.dbai.tuwien.ac.at (4.1/SMI-4.0) id AA03069; Mon, 18 Jan 93 19:25:39 +0100 Received: by altair.dbai.tuwien.ac.at (4.1/SMI-4.0) id AA03082; Mon, 18 Jan 93 19:25:00 +0100 Date: Mon, 18 Jan 93 19:25:00 +0100 From: wsi@vexpert.dbai.tuwien.ac.at (Wolfgang Slany) Message-Id: <9301181825.AA03082@altair.dbai.tuwien.ac.at> To: fuzzy-mail@vexpert.dbai.tuwien.ac.at, denny@tss.com, NAFIPS-L@GSUVM1.BITNET, fuzzy-jp@prec.osaka-u.ac.jp, ai-medicine@vuse.vanderbilt.edu, ca@Think.COM, clp.x@xerox.com, ga-list@aic.nrl.navy.mil, linguist@tamvm1.tamu.edu, nl-kr@cs.rochester.edu, qphysics@cs.washington.edu, simulation@ufl.edu Subject: UPDATE: FUZZY LOGIC IN ARTIFICIAL INTELLIGENCE, LINZ (AUSTRIA) June 28-30, 1993 The deadline for submissions of papers and proposals of workshops for the FLAI'93 conference is January 22, 1993. Email submissions are allowed. For details regarding all aspects of the conference send E-mail to flai93_info@vexpert.dbai.tuwien.ac.at Best regards, and see you in Linz at FLAI'93, Wolfgang SLANY FUZZY LOGIC IN ARTIFICIAL INTELLIGENCE, LINZ (AUSTRIA) June 28-30, 1993 Latest Automatic News: flai93_info@vexpert.dbai.tuwien.ac.at Administrative Stuff: flai93_secr@vexpert.dbai.tuwien.ac.at Conference Chairpersons: flai93@vexpert.dbai.tuwien.ac.at or fax to Ms. Heidi MILOS at +43-1-5055304 From cellular-automata-request@Think.COM Mon Jan 18 16:55:37 1993 Received: by mail.think.com; Mon, 18 Jan 93 16:55:45 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 18 Jan 93 16:55:37 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 18 Jan 93 16:55:26 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA15918; Mon, 18 Jan 93 16:12:03 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Mon, 18 Jan 1993 20:06:55 GMT From: haferman@icaen.uiowa.edu (Jeff Haferman) Organization: University of Iowa, Iowa City, IA, USA Subject: Re: Neural nets for rainfall forecasting? Message-Id: <1993Jan18.200655.16398@news.uiowa.edu> Newsgroups: comp.theory.cell-automata,sci.geo.meteorology Sender: ca-request@Think.COM To: ca@Think.COM le9miiwa@cine88.cineca.it: > > Hi > Is anyone aware of applications of neural nets or cellular automata > to rainfall forecasting? > Any references on this subject are welcome. > > Please email to le9miiwa@cine88.cineca.it > French, M.N., Krajewski, W. F., and Cuykendall, R. R., "Rainfall forecasting in space and time using a neural network," _Journal_of_Hydrology_, Vol. 137, pp. 1-31, 1992. Jeff Haferman internet: haferman@icaen.uiowa.edu Department of Mechanical Engineering DoD 0186 BMWMOA 44469 AMA 460140 The University of Iowa Iowa City, IA 52242 '76 R90S From cellular-automata-request@Think.COM Tue Jan 19 07:55:34 1993 Received: by mail.think.com; Tue, 19 Jan 93 07:55:37 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 19 Jan 93 07:55:34 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 19 Jan 93 07:55:31 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA06103; Tue, 19 Jan 93 07:19:01 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 19 Jan 93 12:06:50 GMT From: cstadbg@csv.warwick.ac.uk (Mr M J Brown) Organization: Computing Services, University of Warwick, UK Subject: WireWorld Message-Id: <1jgqsqINNcn9@clover.csv.warwick.ac.uk> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM Will the Wireworld components etc ... work on a standard Life program running the default rules, or is this a whole new program ...... I would like to experiment with this myself, and I have a pretty quick PC Life program. ============================================================================= _/ _/ _/ _/ _/ _/_/_/_/ | _/_/ _/_/ _/ _/_/ _/ | Michael Brown _/ _/ _/ _/ _/ _/_/ | _/ _/ _/ _/_/ _/ | cstadbg@csv.warwick.ac.uk _/ _/ _/ _/ _/ _/_/_/_/ _/ | mjb@dcs.warwick.ac.uk | csulo@csv.warwick.ac.uk ============================================================================= From cellular-automata-request@Think.COM Tue Jan 19 13:56:33 1993 Received: by mail.think.com; Tue, 19 Jan 93 13:56:36 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 19 Jan 93 13:56:33 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 19 Jan 93 13:56:27 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA13873; Tue, 19 Jan 93 13:30:41 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 19 Jan 93 15:03:34 GMT From: mcrosbie@unix1.tcd.ie (Mark J. Crosbie) Organization: Computer Science, Trinity College Dublin Subject: Is there a CAM for PCs? Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM Hi all, From my reading of "Cellular Automata Machines" by Toffoli from MIT, there seems to be a specialised piece of hardware that they use to speed up processing in their CA applictions. Now while this is all well and good for serious CA work, for those wishing to plug around with CAs (and who are too lazy to write their own CA simulator :-) is there a CA simulator out there which has CAM-like functionality for a PC. Unfortunately, ftp access does not come easy, so if anyone could suggest an e-mail solution ..... Thanks in advance, Mark Crosbie Dept. of Computer Science Trinity College, Dublin Dublin 2 Eire From cellular-automata-request@Think.COM Tue Jan 19 21:06:25 1993 Received: by mail.think.com; Tue, 19 Jan 93 21:06:31 -0500 Return-Path: Received: from Think.COM by mail.think.com; Tue, 19 Jan 93 21:06:25 -0500 Received: from sun2.nsfnet-relay.ac.uk by Early-Bird.Think.COM; Tue, 19 Jan 93 21:06:19 EST Via: uk.ac.birmingham.computer-science; Wed, 20 Jan 1993 02:04:52 +0000 Received: from fat-controller.cs.bham.ac.uk by percy.cs.bham.ac.uk with SMTP (PP) id <09257-0@percy.cs.bham.ac.uk>; Wed, 20 Jan 1993 01:54:24 +0000 Received: by fat-controller.cs.bham.ac.uk (4.1/client/1.2) id AA12889; Wed, 20 Jan 93 01:54:22 GMT Date: Wed, 20 Jan 93 01:54:22 GMT From: aisb93-prog@computer-science.birmingham.ac.uk Message-Id: <12889.9301200154@fat-controller.cs.bham.ac.uk> To: ca@Think.COM Subject: AISB'93 Conference in AI and Cognitive Science ________________________________________________________________________ ________________________________________________________________________ CONFERENCE PROGRAMME and REGISTRATION INFORMATION A I S B' 9 3 'P R O S P E C T S F O R A R T I F I C I A L I N T E L L I G E N C E' Cognitive Science Research Centre The University of Birmingham March 29th -- April 2nd 1993 ________________________________________________________________________ ________________________________________________________________________ CONTENTS 1. Message from the Programme Chair 2. Technical Programme 3. Workshops and Tutorials 4. Registration Form ORGANISATION Programme Chair: Aaron Sloman (University of Birmingham) Programme Committee: David Hogg (University of Leeds) Glyn Humphreys (University of Birmingham) Allan Ramsay (University College Dublin) Derek Partridge (University of Exeter) Local Organiser: Donald Peterson (University of Birmingham) Administration: Petra Hickey (University of Birmingham) GENERAL ENQUIRIES AISB'93, School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, U.K. Email: aisb93-prog@cs.bham.ac.uk Phone: +44-(0)21-414-3711 Fax: +44-(0)21-414-4281 WORKSHOP and TUTORIAL ENQUIRIES Hyacinth S. Nwana, Computer Science Dept. Keele University, Newcastle, Staffs ST5 5BG, ENGLAND. JANET: nwanahs@uk.ac.keele.cs Other: nwanahs@cs.keele.ac.uk Phone: +44 (0)782 583413 Fax: +44 (0)782 713082 ________________________________________________________________________ MESSAGE FROM THE PROGRAMME CHAIR ________________________________________________________________________ The biennial conferences of the Society for the Study of Artificial Intelligence and the Simulation of Behaviour are traditionally "single-track" scientific meetings aiming to bring together all areas of research in AI and computational cognitive science, and AISB'93 is no exception. With the end of the century close at hand, it seemed appropriate to choose a forward looking theme, so the five invited speakers, all distinguished researchers in their own sub-fields, have been asked to identify trends and project into the future, instead of simply surveying past achievements. Some but not all of the submitted papers also analyse prospects; the others report on work already done. The referees and the selection committee used as a major criterion for selection the requirement that papers should be of interest to a general AI audience. All of the papers have in common a commitment to a "design-based" approach to the study of intelligence, though some of them focus mainly on requirements, some mainly on designs and some on actual implementations, and of course there is wide variation not only regarding the sub-domains of AI (such as vision, learning, language, emotions) but also between the techniques used (such as symbolic reasoning, neural net models, genetic algorithms), and also between those who attempt to design intelligent agents using a top down analysis of human-like intelligence and those who work bottom up from primitive insect-like mechanisms. There is also international variety, with papers from several European countries and further afield. This variety of topics and approaches promises to make the conference particularly lively, with plenty of scope for controversy. We have therefore decided to allow a little more time than usual for each item in the programme, so that questions and discussions can add to the interest. There will also be poster presentations, where some work that could not be included in the formal proceedings can be presented, and it is expected that there will be book displays by major AI publishers and possibly some displays and demonstrations by vendors of AI software and systems. The conference will be preceded by a programme of seven tutorials and workshops for which separate registration is available. Integral Solutions Limited have agreed to present a prize of AI software, including Poplog, and a place on one of their training courses, for the paper voted "best presented" by the audience. For those involved in AI and Cognitive Science, the conference is a primary opportunity to meet, discuss and learn about current work. For those new to these fields, the conference is a chance to become acquainted with them in pleasant surroundings and to meet the people involved. For full-time students, large reductions in registration fees are offered. The location of the conference is one of the attractive halls of residence in a pleasant lakeside setting at one end of the campus of the University of Birmingham. This is not very far from the city centre, so a visit to one of the local attractions of the centre, such as the renowned Symphony Hall, will require a journey of only a few minutes by taxi or train. Single room accommodation has been booked, and the auditorium is in the same building as the bedrooms and dining room, so that the conference will provide excellent opportunities for informal mixing and discussions. The number of rooms available is limited, so early booking is recommended. We look forward to seeing you and hope you enjoy the conference. Aaron Sloman. ________________________________________________________________________ TECHNICAL PROGRAMME (The order is provisional. Invited talks are asterisked) ________________________________________________________________________ MONDAY MARCH 29TH Workshops and Tutorials (see below) TUESDAY MARCH 30TH (Morning) Workshops and Tutorials (see below) TUESDAY MARCH 30TH (Afternoon) * Kurt Van Lehn (Pittsburg) --- Prospects for modelling human learning (e.g. college physics) Husbands, Harvey, Cliff --- An evolutionary approach to AI Edmund Furse --- Escaping from the box Thomas Vogel --- Learning biped robot obstacle crossing Antunes, Moniz, Azevedo --- RB+ the dynamic estimation of the opponent's strength WEDNESDAY 31ST MARCH * Ian Sommerville (Lancaster) --- Prospects for AI in systems design Oh, Azzelarabe, Sommerville, French --- Incorporating a cooperative design model in a computer aided design improvement system Stuart Watt --- Fractal behaviour analysis Valente, Breuker, Bredewg --- Integrating modeling approaches in the commonKADS library Cawsey, Galliers, Reece, Jones --- Revising beliefs and intentions: a unified framework for agent interaction * Allan Ramsay (Dublin) --- Prospects for natural language processing by machine Lin, Fawcett, Davies --- Genedis: the discourse generator in communal Miwa, Simon --- Production system modelling to represent individual differences: tradeoff between simplicity and accuracy in simulation of behaviour Freksa, Zimmerman --- Enhancing spatial reasoning by the concept of motion POSTER SESSION THURSDAY 1ST APRIL * Glyn Humphreys (Birmingham) --- Prospects for connectionism - science and engineering Rodrigues, Lee --- Nouvelle AI and perceptual control theory Vogel, Popwich, Cercone --- Logic-based inheritance reasoning Beatriz Lopez --- Reactive planning through the integration of a case-based system and a rule-based system James Stone --- Computer vision: what is it good for? SESSION ON EMOTIONS AND MOTIVATION Bruce Katz --- Musical resolution and musical pleasure Moffatt, Phaf, Frijda --- Analysis of a model of emotions Beaudoin, Sloman --- A computational exploration of the attention control theory of motivator processing and emotion Reichgelt, Shadbolt et al. --- EXPLAIN: on implementing more effective tutoring systems POSTER SESSION CONFERENCE DINNER FRIDAY 2ND APRIL (Morning) * David Hogg (Leeds) --- Prospects for computer vision Elio, Watanabe --- Simulating the interactive effects of domain knowledge and category structure within a constructive induction system Dalbosco, Armando --- MRG an integrated multifunctional reasoning system Bibby, Reichgelt --- Modelling multiple uses of the same representation in SOAR1 Sam Steel --- A connection between decision theory and program logic INFORMAL WORKSHOP ON MOTIVATION, EMOTIONS AND ATTENTION (see below) ________________________________________________________________________ Workshop 1: Connectionism, Cognition and a New AI Organiser: Dr Noel Sharkey (Exeter) Committee: Andy Clark (Sussex) Glyn Humphries (Birmingham) Kim Plunkett (Oxford) Chris Thornton (Sussex) Time: Monday 29th pm & Tuesday 30th March (all day) Note: This workshop overlaps with the events in the main Technical Programme on the afternoon on Tuesday 30th. ________________________________________________________________________ A number of recent developments in Connectionist Research have strong implications for the future of AI and the study of Cognition. Among the most important are developments in Learning, Representation, and Productivity (or Generalisation). The aim of the workshop would be to focus on how these developments may change the way we look at AI and the study of Cognition. SUGGESTED TOPICS FOR DISCUSSION ABSTRACTS INCLUDE: Connectionist representation, Generalisation and Transfer of Knowledge, Learning Machines and models of human development, Symbolic Learning versus Connectionist learning, Advantages of Connectionist/Symbolic hybrids, Modelling Cognitive Neuropsychology, Connectionist modelling of Creativity and music (or other arts). WORKSHOP ENTRANCE Attendance at the workshop will be limited to 50 or 60 places, so please let us know as soon as possible if you are planning to attend, and to which of the following categories you belong. DISCUSSION PAPERS Acceptance of discussion papers will be decided on the basis of extended abstracts (try to keep them under 500 words please) clearly specifying a 15 to 20 minute discussion topic for oral presentation. ORDINARY PARTICIPANTS A limited number places will be available for participants who wish to sit in on the discussion but do not wish to present a paper. But please get in early with a short note saying what your purpose in attending is. PLEASE SEND SUBMISSIONS TO: Dr. Noel Sharkey Centre for Connection Science Dept. Computer Science University of Exeter Exeter EX4 4PT Devon U.K. Email: noel@uk.ac.exeter.dcs REGISTRATION: see Registration Form below. ________________________________________________________________________ Workshop 2: Qualitative and Causal Reasoning Organiser: Dr Tony Cohn (Leeds, U.K.) Committee: Mark Lee (Aberystwth) Chris Price (Aberystwth) Chris Preist (Hewlett Packard Labs, Bristol) Time: Monday 29th March + Tuesday 30th March (morning) ________________________________________________________________________ This workshop is intended to follow on from the series of DKBS (Deep Knowledge Based Systems) workshops which were originally initiated under the Alvey programme. QCR93 will be the 8th in the series. The format of the 1.5 day workshop will consist mainly of presentations, with ample time for discussion. It is hoped to have an invited talk in addition. Participation will be by invitation only and numbers will be limited in order to keep an informal atmosphere. If you wish to present a paper at the workshop, please send 4 copies (max 5000 words) to the address below by 20 Feb. An electronic submission is also possible (either postscript or plain ascii). Alternatively send a letter or email explaining your reasons for being interested in attending. Papers may address any aspect of Qualitative and Causal Reasoning and Representation. Thus the scope of the workshop includes the following topics: * Task-level reasoning (e.g., design, diagnosis, training, etc.) * Ontologies (e.g., space, time, fluids, etc.) * Explanation, causality and teleology * Mathematical formalization of QR * Management of multiple models (formalization, architecture, studies) * Model building tools * Integration with other techniques (e.g., dynamics, uncertainty, etc.) * Methodologies for selecting/classifying QR methods * Practical applications of QR, or Model Based Reasoning etc. These topics are not meant to be prescriptive and papers on other related or relevant topics are welcome. Suggestions for special sessions for the workshop are also welcome (eg panel session topics). There may be some partial bursaries available to students who wish to attend. If you wish to apply for such a bursary, then please send a letter giving a case for support (include details of any funding available from elsewhere). A CV should be attached. Electronic submission is preferred. REGISTRATION: see Registration Form below. CORRESPONDENCE AND SUBMISSIONS: Tony Cohn, Division of AI, School of Computer Studies, University of Leeds, LEEDS, LS2 9JT, ENGLAND. UUCP: ...!ukc!leeds!agc JANET: agc@uk.ac.leeds.scs INTERNET: agc@scs.leeds.ac.uk BITNET: agc%uk.ac.leeds.scs@UKACRL PHONE: +44 (0)532 335482 FAX: +44 (0)532 335468 ________________________________________________________________________ Workshop 3: AISB POST-GRADUATE STUDENT WORKSHOP Organiser: Dr Hyacinth Nwana University of Keele, UK. Time: Monday 29th (all day) + Tuesday 30th March (morning) ________________________________________________________________________ Many postgraduate students become academically isolated as a result of working in specialised domains within fairly small departments. This workshop is aimed at providing a forum for graduate students in AI to present and discuss their ideas with other students in related areas. In addition there will invited presentations from a number of prominent researchers in AI. A small number of group discussions is planned, including study for and completion of theses, life after a doctorate, paper refereeing and how to make use of your supervisor. All attendees are expected to present an introduction to their research in a poster session on the first day's morning. In addition a couple of attendees will be given the opportunity to present short papers. Confirmed tutors so far include: Dr John Self (Lancaster) - 'Why do supervisors supervise?' Dr Steve Easterbrook (Sussex) - 'How to write a thesis' Dr Elizabeth Churchill (Nottingham) - Title to be confirmed. Dr Peter Hancox (Birmingham) - Title to be confirmed. Applicants are asked to submit a two-page abstract of their current work. In addition full papers of between 3000 and 5000 words may be submitted. These will be considered for publication in a supplement to the AISB quarterly journal. Deadline for 2-page abstracts: 10th February 1993 Please send an abstract or a full paper of work to: Dr. Hyacinth S. Nwana, Computer Science Dept. Keele University, Newcastle, Staffs ST5 5BG, ENGLAND. JANET: nwanahs@uk.ac.keele.cs other: nwanahs@cs.keele.ac.uk tel: +44 (0)782 583413 fax: +44 (0)782 713082 REGISTRATION: see Registration Form below. ________________________________________________________________________ Workshop 4: Motivation, Emotions and Attention Organiser: Tim Read, University of Birmingham Time: Friday 2nd April 2.30 - 5pm ________________________________________________________________________ An informal workshop will be held after lunch on Friday 2nd April enabling further discussion of issues raised in the Thursday afternoon session on motivation and emotions, and possibly additional presentations. There will be no charge, though numbers will be limited by available space. For more information contact The study of emotion encounters many difficulties, among them the looseness of emotional terminology in everyday speech. A theory of emotion should supersede this terminology, and should connect with such issues as motivation, control of attention, resource limitations architectural parallelism and underlying biological mechanisms. Computation provides useful analogies in generating an information processing account of emotion, and computer modelling is a rigorous and constructive aid in developing theories of affect. It makes sense for researchers within this field to collaborate, and the aim of the workshop is to facilitate cross-fertilisation of ideas, sharing of experience, and healthy discussion. If you wish to make a presentation, please contact: Tim Read School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, England EMAIL T.M.Read@cs.bham.ac.uk Phone: +44-(0)21-414-4766 Fax: +44-(0)21-414-4281 REGISTRATION: see Registration Form below (no charge for this workshop) ________________________________________________________________________ Tutorial 1: Collaborative Human-Computer Systems: Towards an Integrated Theory of Coordination Dr Stefan Kirn University of Muenster, Germany Time: Monday 29th March (morning) ________________________________________________________________________ Intelligent support of human experts' intellectual work is one of the most competitive edges of computer technology today. Important advances have been made in the fields of computer networking, AI (e.g., KADS, CBR, Distributed AI), integrated design frameworks (the European JESSI project), nonstandard databases (e.g., databases for teamwork support), computer supported cooperative work, and organizational theory. The time is ripe for developing integrated human computer collaborative systems to significantly enhance the problem solving capabilities of human experts. Perhaps one of the most interesting challenges here is the development of an integrated theory of human computer coordination. Such a theory will help to link humans and computers together in order to let them collaboratively work on complex "nonstandard" problems. It is the aim of the tutorial to put the loose ends of the above mentioned disciplines together thus arguing towards the development of an integrated theory of human computer coordination. Only undergraduate-level knowledge in at least one of the following fields is assumed: AI, database/information systems, organisational theory and CSCW. Dr Stefan Kirn is senior researcher and project leader at the Institute of Business and Information Systems of the Westfaelische Wilhelms-University of Muenster. He has more than 30 major publications in international journals and conferences, primarily in the areas of DAI, Cooperative Information Systems, CSCW and Computer-Aided Software Engineering. REGISTRATION: see Registration Form below. ________________________________________________________________________ Tutorial 2: The Motivation, Meaning and Use of Constraints Dr Mark Wallace European Computer-Industry Research Centre Munchen, Germany. Time: Monday 29th March (afternoon) ________________________________________________________________________ This tutorial explains how constraints contribute to clear, clean, efficient programs. We study constraints as specification tools, as formal tools, and as implementation tools. Finally we examine the use of constraints in search and optimisation problems. As the tutorial unfolds, we will explain the three different notions of constraints: constraints as built-in relations, with built-in solvers; constraints as active agents, communicating with a store; and propagation constraints. We will also explain how these notions are related, and moreover how the different types of constraints can all be combined in a single program. For programming examples, the logic programming framework will be used. It will be aimed at postgraduates, researchers and teachers of AI, who would like to know what constraints are, and what they are for. Also anyone interested in declarative programming, seeking a solution to the problem of efficiency, will benefit from the tutorial. An understanding of formal logic will be assumed, and some familiarity with logic programming will be necessary to appreciate the programming examples. Dr Mark Wallace leads the Constraints Reasoning Team at ECRC (the European Computer-Industry Research Centre), Munich. He introduced "Negation by Constraints" at SLP'87. He has recently presented papers at IJCAI'92, FGCS'92 and JFPL'92. Recent tutorial presentations include a short course on Deductive and Object-Oriented Knowledge Bases at the Technical University of Munich, and "Constraint Logic Programming - An Informal Introduction", written with the CORE team at ECRC for the Logic Programming Summer School, '92. REGISTRATION: see Registration Form below. ________________________________________________________________________ Tutorial 3: A Little Turing and Goedel for Specialists in AI Prof. Alexis Manaster Ramer Wayne State University, USA. Time: Monday 29th March (morning + afternoon) ________________________________________________________________________ Currently debated issues in the foundations of AI go directly back to technical work of people like Turing and Godel on the power and limits of formal systems and computing devices. Yet neither the relevant results nor the intellectual climate in which they arose are widely discussed in the AI community (for example, how many know that Godel himself believed that the human mind was not subject to the limits set by his theorems on formal systems?). The purpose of this tutorial is to develop a clear picture of the fundamental results and their implications as seen at the time they were obtained and at the present time. We will primarily refer to the work of Godel, Turing, Chomsky, Hinttika, Langendoen and Postal, Searle, and Penrose. Some background knowledge is assumed: some programming, some AI and some discrete mathematics. Dr Alexis Manaster Ramer is professor of Computer Science at Wayne State University. He has over 100 publications and presentations in linguistics, computational linguistics, and foundations of CS and AI. A few years ago, he taught a short course on the theory of computation for the Natural Language Processing group at the IBM T.J.Watson Research Center (Hawthorne, NY, USA) and this past summer taught a one-week advanced course on mathematics of language at the European Summer School in Logic, Language, and Information (Colchester, UK). REGISTRATION: see Registration Form below. ________________________________________________________________________ OTHER MEETINGS ________________________________________________________________________ LAGB CONFERENCE. Shortly before AISB'93, the Linguistics Association of Great Britain (LAGB) will hold its Spring Meeting at the University of Birmingham from 22-24th March, 1993. For more information, contact Dr. William Edmondson: postal address as below; phone +44-(0)21-414-4773; email EDMONDSONWH@vax1.bham.ac.uk JCI CONFERENCE The Joint Council Initiative in Cognitive Science and Human Computer Interaction will hold its Annual Meeting on Monday 29th March 1993 in the same buildings as AISB'93 (in parallel with the AISB'93 workshops and tutorials). The theme will be "Understanding and Supporting Acquisition of Cognitive Skills". For more information, contact Elizabeth Pollitzer, Department of Computing, Imperial College, 180, Queens Gate, London SW7 2BZ, U.K.; phone +44-(0)71-581-8024; email eep@doc.ic.ac.uk. ________________________________________________________________________ REGISTRATION NOTES Main Programme, Workshops and Tutorials ________________________________________________________________________ o Please print off the form, tick through the items you require, enter sub-totals and totals and send by post, together with payment, to: AISB'93 Registrations, School of Computer Science, University of Birmingham, Edgbaston, Birmingham B15 2TT, U.K. o Payment should be made by cheque or money order payable to `The University of Birmingham', drawn in pounds sterling on a UK clearing bank and should accompany the form below. o Registrations postmarked after 10th March count as late registrations. o It is not possible to register by email. o Confirmation of booking, a receipt, and travel details will be sent on receipt of this application form. o The Conference Dinner (20 pounds) is on the evening of Thursday 1st. o Delegates wishing to join AISB (thus avoiding the non-AISB member supplement) should contact: AISB Administration, Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH, U.K.; phone: +44-(0)273 678379; fax: +44-(0)273 678188; email: aisb@cogs.susx.ac.uk Donald Peterson, January 1993. ______________________________________________________________________ R E G I S T R A T I O N F O R M ---- A I S B' 9 3 ______________________________________________________________________ Figures in parentheses are for full-time students (send photo copy of ID). ACCOMMODATION and FOOD 28th 29th 30th 31st 1st sub-totals lunch 5.50 5.50 5.50 5.50 ______ dinner 7.50 7.50 7.50 20.00 ______ bed & 23.00 23.00 23.00 23.00 23.00 ______ breakfast total ______ vegetarians please tick _____ TECHNICAL PROGRAMME, WORKSHOPS and TUTORIALS technical programme 175 (40) _____ non-AISB members add 30 _____ late registration add 35 _____ Nwana workshop 50 _____ Sharkey workshop 60 (30) _____ Cohn workshop 60 (30) _____ Read workshop 0 _____ Manaster Ramer tutorial 110 (55) _____ Wallace tutorial 75 (30) _____ Kirn tutorial 75 (30) _____ total _____ Pounds PERSONAL DETAILS Full time Name ___________________________________________ student? Y/N Address ___________________________________________ ___________________________________________ ___________________________________________ ___________________________________________ Phone _________________________ Fax ___________ Email ___________________________________________ I wish to register for the events indicated, and enclose a cheque in pounds sterling, drawn on a U.K. clearing bank and payable to the `University of Birmingham' for ..... Signed _________________________ Date ___________ From cellular-automata-request@Think.COM Tue Jan 19 23:03:16 1993 Received: by mail.think.com; Tue, 19 Jan 93 23:03:20 -0500 Return-Path: Received: from Think.COM by mail.think.com; Tue, 19 Jan 93 23:03:16 -0500 Received: from unamvm1.dgsca.unam.mx by Early-Bird.Think.COM; Tue, 19 Jan 93 23:03:09 EST Message-Id: <9301200403.AA26673@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 9488; Tue, 19 Jan 93 22:01:53 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.03B) with BSMTP id 6068; Tue, 19 Jan 93 22:01:52 MEX Date: Tue, 19 Jan 93 21:34:12 MEX From: "Harold V. McIntosh" Subject: WireWorld on a PC. To: "(Cellular Automata)" Mr M J Brown (19 Jan 1993 12:06:50 GMT) asks: > > Will the WireWorld components etc ... work on a standard Life program running > the default rules, or is this a whole new program ...... > > I would like to experiment with this myself, and I have a pretty quick PC > Life program. > No, it's a whole new program. Although it uses the same 3x3 Moore neighborhood as Life, it has four states - background (or card), inert (or wire), electron head and electron tail. The electron is polarized, fixing its direction of travel, otherwise two states wouldn't be necessary. - Depending on the kind of Life program you have, it may be possible to fix it up. If you have the .EXE without provision for alternate rules, there's no hope, but if you have the sources or you wrote it yourself, fixing it would be quite easy. Some programs, like Rudy Rucker's CA Lab, let you insert new rules, if what you want is not already there. - The rules are easy - card is always card, wire is always wire (but keep on reading). An electron head always goes through the progression head to tail to wire. So the only thing that needs much thought is how an electron head is created. You either put it there initially (preferably with a tail at one side to guide it) or it arises from a wire cell having ONE or TWO head cells amongst its eight distinct neighbors (when a cell is already a head it inexorably becomes a tail). - If you want to make the program fast, you only need to keep track of heads and tails, since everything else is passive. But you don't necessarily want it to be TOO fast, because you want to watch the electrons moving hither and yon. What you really want is good screen editing and saving, because all the fun lies in building up the initial state (and of course, letting it run). Also you don't want to just set up states, you'd like a library of components which you can move around and connect. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Thu Jan 21 22:45:39 1993 Received: by mail.think.com; Thu, 21 Jan 93 22:45:41 -0500 Return-Path: Received: from Think.COM by mail.think.com; Thu, 21 Jan 93 22:45:39 -0500 Received: from gatech.edu by Early-Bird.Think.COM; Thu, 21 Jan 93 22:45:37 EST Received: from math.gatech.edu by gatech.edu (4.1/Gatech-9.1) id AA06234 for ca@think.com; Thu, 21 Jan 93 22:48:15 EST Received: from math24.gatech.edu (math25.gatech.edu) by math.gatech.edu (4.1/SMI-4.1) id AA16147; Thu, 21 Jan 93 22:47:02 EST Date: Thu, 21 Jan 93 22:47:02 EST From: hurd@math.gatech.edu (Lyman Hurd) Message-Id: <9301220347.AA16147@math.gatech.edu> Received: by math24.gatech.edu (4.1/SMI-4.1) id AA13433; Thu, 21 Jan 93 22:49:55 EST To: ca@Think.COM Subject: fractal book I am pleased to announce the arrival of the book: Fractal Image Compression by Michael Barnsley and Lyman Hurd. hardbound 244 pages, 16 color plates A sequel to Fractals Everywhere, Fractal Image Compression describes the mathematics underlying the Fractal Transform an image compression method discovered by Michael Barnsley and developed at Iterated Systems. Topics include: * Iterated Function Systems * Local IFS and the Black and White Fractal Transform * The Grayscale Fractal Transform * Information Theory * Huffman codes * Arithmetic Codes * JPEG Image Compression Example programs in C are interspersed throughout the text. Copies of the book are available direct from one of the authors. Send check (payable to Lyman Hurd or Hurd Enterprises) for $49.95 US (this includes shipping) to: Hurd Enterprises P.O. Box 888575 Atlanta, GA 30356 Residents of GA please add sales tax. From cellular-automata-request@Think.COM Wed Jan 27 15:39:18 1993 Received: by mail.think.com; Wed, 27 Jan 93 15:39:24 -0500 Return-Path: Received: from Think.COM by mail.think.com; Wed, 27 Jan 93 15:39:18 -0500 Received: from sjsumcs.SJSU.EDU by Early-Bird.Think.COM; Wed, 27 Jan 93 15:39:15 EST Received: by sjsumcs.SJSU.EDU (5.65c/IDA-1.4.4) id AA12452; Wed, 27 Jan 1993 12:39:51 -0800 Date: Wed, 27 Jan 1993 12:39:51 -0800 From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker) Message-Id: <199301272039.AA12452@sjsumcs.SJSU.EDU> To: ca@Think.COM Subject: Free CA programs Autodesk has two free CA programs for the PC compatible machine on Compuserve. If you can get on Compuserve, enter GO ADESK and go into Library 4 -- CA Lab/CHAOS of the Autodesk Software Forum. The CA files are CALAB1.COM (7K) and CALAB2.EXE (200K). These files are self-extracting archives. CALAB1.COM will give you a version of the RC program that comes with CA LAB and runs a diffusion CA, Life, Brain, Vote, and some Langton style CAs. CALAB2.EXE will give you a version of the CADEMO program that comes with CA LAB and runs a variety (I think about 15) different CAs in demo mode. The CALAB1.COM program RC is interactive and runs in low resolution, the CALAB2.EXE program CADEMO is not interactive, and runs in a higher (320x200) resolution. I no longer work for Autodesk, by the way, but I highly recommend these programs for those who want a quick free look at the beauties of CAs. From cellular-automata-request@Think.COM Tue Feb 9 08:23:51 1993 Received: by mail.think.com; Tue, 9 Feb 93 08:23:56 -0500 Return-Path: Received: from Think.COM by mail.think.com; Tue, 9 Feb 93 08:23:51 -0500 Received: from vnet.ibm.com by Early-Bird.Think.COM; Tue, 9 Feb 93 08:23:37 EST Message-Id: <9302091323.AA00411@Early-Bird.Think.COM> Received: from HAIFASC3 by vnet.ibm.com (IBM VM SMTP V2R2) with BSMTP id 1718; Tue, 09 Feb 93 05:08:15 EST Date: Tue, 9 Feb 93 12:00:35 IDT From: "Martin Charles Golumbic" To: schild@bimacs.cs.biu.ac.il, mcvax!swivax!otten@uunet.uu.edu, AI-ED@sumex-aim.stanford.edu, jws@ib.rl.ac.uk, CA@Think.COM, CLP.X@Xerox.com, connectionists@CS.CMU.EDU, cvnet%YORKVM1.bitnet@cunyvm.cuny.edu, cybsys-l%BINGVMB.bitnet@cunyvm.cuny.edu, fj-ai@et1.jp, ga-list@aic.nrl.navy.mil, fox@vtopus.cs.vt.edu, LANTRA-L%FINHUTC.bitnet@cunyvm.cuny.edu, mod-ki%unido.irb%UNIDO.bitnet@cunyvm.cuny.edu, neuron@csl.ti.com, NL-KR@cs.rochester.edu, nnsc@nnsc.nsf.net, PROLOG@sushi.stanford.edu, NL-KR@cs.rochester.edu Subject: BISFAI-93 ....... Second Announcement ....... ....... Please Post ....... Submission deadline is March 1, 1993 Third Bar-Ilan Symposium on the Foundations of Artificial Intelligence 15-17 June 1993 -- Ramat Gan, Israel Bar-Ilan University, through its Center for Applied Logic and Artificial Intelligence (CALAI) and the Abraham Gelbart Research Institute for the Mathematical Sciences, is pleased to announce its third Symposium on the Foundations of Artificial Intelligence (BISFAI-93) to be held June 15-17, 1993 in Ramat Gan, Israel. The Symposium is also supported by AAAI and is held in cooperation with the ECCAI and the IAAI. The Symposium is international in scope, with invited lectures by leading researchers and contributed papers on foundations of AI. The invited speakers for BISFAI-93 will be Barbara Grosz, Jean-Louis Lassez, Vladimir Lifschitz and Jeffrey Rosenschein. Symposium Chair is Martin Golumbic. This biennial event focuses on a range of topics of concern to scholars applying quantitative, combinatorial, logical, algebraic and algorithmic methods to AI areas as diverse as decision support, automatic reasoning, knowledge-based systems, machine learning, computational linguistics, computer vision, and robotics. These include applied logicians, algorithms and complexity researchers, AI theorists, and applications specialists using mathematical methods. Although a small meeting is anticipated, with selected speakers and no parallel sessions, an attempt will be made to open attendance to all interested research scientists. ............ CALL FOR PAPERS .............. High quality research papers are solicited for consideration by the program committee to be presented at the Symposium. Submissions of extended abstracts of 4-10 pages or full papers must arrive by 1 March 1993 and should be sent in triplicate to: Dr. Sarit Kraus, Program Chair BISFAI-93 Department of Mathematics and Computer Science Bar-Ilan University, Ramat Gan, Israel email: sarit@bimacs.bitnet or sarit@bimacs.cs.biu.ac.il Decisions on presentations will be made on or before 20 April 1993. Selected refereed full length theory papers will be published in a special issue of the Annals of Mathematics and Artificial Intelligence and selected application oriented papers in the journal Applied Artificial Intelligence, as a permanent record of the Symposium. These should be submitted shortly after the conclusion of the Symposium. No informal proceedings will appear. ............ TRAVEL GRANTS .............. A limited number of grants for partial support will be available for graduate students and postdocs. Those interested in applying for such a grant should send (1) a short statement about their research and (2) the name of at least one faculty member who can recommend them, to Prof. Martin Golumbic, Symposium Chair BISFAI-93 IBM Israel Scientific Center MATAM Technology Park Haifa, Israel email: golumbic@haifasc3.vnet.ibm.com The deadline for grant requests is April 15, 1993. ............ FURTHER INFORMATION .............. For further information on the Symposium and to receive additional announcements, contact Dr. Ronen Feldman, BISFAI-93 Organizing Chair Department of Mathematics and Computer Science Bar-Ilan University, Ramat Gan, ISRAEL email: feldman@bimacs.bitnet or feldman@bimacs.cs.biu.ac.il Hotel accommodations will be reserved at the Kfar Hamaccabia Hotel in Ramat Gan which also has sports facilities available gratis for the Symposium participants. The Symposium will take place at the University, which is a short ride, or a half-hour walk, from the hotel. Program Committee: Yaacov Choueka (Bar-Ilan University) Rina Dechter (U.C. Irvine) Ronen Feldman (Bar-Ilan University) Ariel Frank (Bar-Ilan University) Dov Gabbay (Imperial College) Dan Geiger (Technion) Martin Golumbic (IBM Israel and Bar-Ilan University) Joe Halpern (IBM Almaden Research Center) Jeff Johnson (Open University, England) Moshe Koppel (Bar-Ilan University) Sarit Kraus (Bar-Ilan University) Daniel Lehmann (Hebrew University) Larry Manevitz (Haifa University) Jack Minker (University of Maryland) Leora Morgenstern (IBM Watson Research Center) Ephraim Nissan (Bar-Ilan University) Judea Pearl (UCLA) Donald Perlis (University of Maryland) Michael Richter (University of Kaiserslautern) Jeff Rosenschein (Hebrew University) Uri Schild (Bar-Ilan University) Micha Sharir (New York University and Tel Aviv) Jonathan Stavi (Bar-Ilan University) ======================================================================= >>>> PLEASE RETURN THIS FORM TO RECEIVE FURTHER MAILINGS <<<< Dr. Ronen Feldman, BISFAI-93 Organizing Chair Department of Mathematics and Computer Science Bar-Ilan University, Ramat Gan, ISRAEL email: feldman@bimacs.bitnet or feldman@bimacs.cs.biu.ac.il Name: ________________________________________________________ Affiliation: _________________________________________________ Address: _____________________________________________________________________ Electronic mail: ____________________________________________ _____ I will attend the Bar-Ilan Symposium June 15-17, 1993 _____ Please send me the final announcement in May 1993. I do / do not plan to submit a paper. From cellular-automata-request@Think.COM Wed Feb 10 03:13:28 1993 Received: by mail.think.com; Wed, 10 Feb 93 03:13:31 -0500 Return-Path: <@PUCC.PRINCETON.EDU:yz@trboun> Received: from Think.COM by mail.think.com; Wed, 10 Feb 93 03:13:28 -0500 Received: from pucc.Princeton.EDU by Early-Bird.Think.COM; Wed, 10 Feb 93 03:13:24 EST Received: from PUCC.PRINCETON.EDU by pucc.Princeton.EDU (IBM VM SMTP V2R2) with BSMTP id 7954; Wed, 10 Feb 93 03:12:52 EST Received: from TRBOUN.BITNET (NJE origin MAILER@TRBOUN) by PUCC.PRINCETON.EDU (LMail V1.1c/1.7e) with BSMTP id 6835; Wed, 10 Feb 1993 03:12:51 -0500 Received: by trboun.bitnet (MX V3.1) id 7798; Wed, 10 Feb 1993 10:09:12 EST Sender: yz%TRBOUN.BITNET@pucc.Princeton.EDU Date: Wed, 10 Feb 1993 10:09:11 EST From: yz%TRBOUN.BITNET@pucc.Princeton.EDU Reply-To: yz%TRBOUN.BITNET@pucc.Princeton.EDU To: mcvax!swivax!otten@uunet.uu.edu Cc: jws@ib.il.ac.uk, ca@Think.COM Message-Id: <00967EB3.DEFF08A0.7798@trboun.bitnet> Subject: Call for Papers: 2nd Turkish Symp on AI and NN From: GUNEY::AKIN02 5-JAN-1993 14:35:39.58 To: YZ CC: Subj: cfp CALL FOR PAPERS 2nd Turkish Symposium on Artificial Intelligence and Artificial Neural Networks Bogazici University Istanbul, Turkey June 24-25, 1993 Supported by : Bogazici University, Istanbul; Bilkent University, Ankara; IEEE Computer Society Turkiye Section; Middle East Technical University, Ankara; TUBITAK, The Scientific and Technical Research Council of Turkey. Scope Commonsense Reasoning, Knowledge Representation, Learning, Natural Language Processing, Control and Planning, Expert Systems, Theorem Proving, Intelligent Databases, Signal Processing, Speech Processing, Vision and Image Processing, Pattern Recognition, Robotics, Programming Languages, Simulation Environments, Theoretical Foundations, Hardware Implementations, Industrial Applications, Social, Legal, and Ethical Aspects, Paper submissions Deadline for full papers limited to 6 single spaced (12 point) A4 pages: March 1, 1993. Author notification: April 1, 1993. Camera ready copies: May 1, 1993. Send submissions (in English or Turkish) to Dr. L. Akin, Department of Computer Engineering, Bogazici University, TR-80815 Istanbul, Turkey. Tel (voice): +90 1 263 15 00 x 1323 (fax): +90 1 265 84 88 E-mail: yz@trboun.bitnet Symposium Chair: Selahattin Kuru, Bogazici Univ. Program Committee: Levent Akin, Bogazici Univ.; Varol Akman, Bilkent Univ.; Ethem Alpaydin, (chair) Bogazici Univ.; Isil Bozma, Bogazici Univ.; M. Kemal Ciliz, Bogazici Univ.; Fikret Gurgen, Bogazici Univ.; H. Altay Guvenir, Bilkent Univ.; Ugur Halici METU; Yorgo Istefanopulos, Bogazici Univ.; Sakir Kocabas, TUBITAK Gebze Res. Center; Selahattin Kuru, Bogazici Univ.; Kemal Oflazer, Bilkent Univ.; A. C. Cem Say, Bogazici Univ.; Nese Yalabik, METU Local Organizing Committee: Levent Akin (chair); Ethem Alpaydin; Hakan Aygun; Sema Oktug; A. C. Cem Say; Mehmet Yagci From cellular-automata-request@Think.COM Sat Feb 13 09:24:32 1993 Received: by mail.think.com; Sat, 13 Feb 93 09:24:34 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sat, 13 Feb 93 09:24:32 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sat, 13 Feb 93 09:24:29 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA14584; Sat, 13 Feb 93 09:22:18 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Sat, 13 Feb 93 01:29:02 GMT From: achamber@cs.weber.edu (Tony Chamberlain) Organization: University of Utah Computer Center Subject: Re: Big life and blt life (Re: This Week's Finds...) Message-Id: <1993Feb13.012902.16592@fcom.cc.utah.edu> Newsgroups: comp.theory.cell-automata References: <2b7807dcwnr070@ark.abg.sub.org>, <9302101837.hoey@aic.nrl.navy.mil>, <12FEB199308272603@xenon.arc.nasa.gov> Sender: ca-request@Think.COM To: ca@Think.COM In article <12FEB199308272603@xenon.arc.nasa.gov>, dueker@xenon.arc.nasa.gov (The Code Slinger) writes: |> hoey@AIC.NRL.Navy.Mil (Dan Hoey) wrote... |> >baez@guitar.ucr.edu (John Baez) wrote: |> > |> >> (Does anyone know where I can get a copy of xlife from) |> > |> >I don't know if it's the most recent version, but /contrib/xlife.tar.Z |> >is on export.mit.edu. |> > |> |> My site does not know "export.mit.edu". Anybody have an IP addr for it? |> And is the /contrib/xlife.tar.Z that's there the most recent version? In this article I write: (sorry i always thought thos headers were weired ) The reason it doesn't work is the actually canonical name export.lcs.mit.edu ^^^ (Ooooh, Aaaah! My first use of the underlining carrots, wow i'm almost a use net guru). Tony Chamberlain achamber@cs.weber.edu From cellular-automata-request@Think.COM Sat Feb 13 15:25:28 1993 Received: by mail.think.com; Sat, 13 Feb 93 15:25:30 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sat, 13 Feb 93 15:25:28 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sat, 13 Feb 93 15:25:25 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA21089; Sat, 13 Feb 93 14:27:59 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 13 Feb 93 15:23:24 GMT From: andrew@rentec.com (Andrew Mullhaupt) Organization: Renaissance Technologies Corp., Setauket, NY. Subject: Re: This Week's Finds in Mathematical Physics Message-Id: <1571@kepler1.rentec.com> Newsgroups: sci.math,sci.physics,comp.theory.cell-automata References: <1993Feb8.212910.7749@galois.mit.edu>, <9FEB199322203138@zeus.tamu.edu>, <1993Feb10.193926.22293@galois.mit.edu> Sender: ca-request@Think.COM To: ca@Think.COM In article <1993Feb10.193926.22293@galois.mit.edu> jbaez@riesz.mit.edu (John C. Baez) writes: >In article <9FEB199322203138@zeus.tamu.edu> dwr2560@zeus.tamu.edu (RING, DAVID WAYNE) writes: > >>condition seemed to kill the 'life' in the array. But toroidal boundaries >>seemed to make the 'life' last _much_ longer. So much so that I wonder This has been investigated in a somewhat more general context. It will probably require a literature search to find it and bring it up to date, but about six years ago I refereed a paper on this subject, I think for the Journal of Control and Systems Theory, but I can't recall. (It was accepted.) Some people have asked for a reference to Gosper's result. I think you can find a paper by him in the Physica D special issue on cellular automata, which I think is a conference proceedings from Los Alamos. While we're at it, one guy sent me some PDP-11 code and asked if it might be close to Gosper's solution. I can't tell, since I haven't had any interest in PDP-11 since 1979. The way to tell is this - if your code represents the universe as an _array_, you're going to run out of memory and go slow. You might be clever about skipping evaluations you don't need to do, but to get Gosper's solution, you need to avoid calculating each generation successively, nor should you represent every state explicitly. Gosper's solution represents the universe as a multiway tree and recognizes if different parts are the same, (in which case it computes the generations for these pieces only once) and it can recognize if the same pattern occurs in different generations (which allows it to attack periodic cases quite effectively). The only annoying part is the boundary conditions of the regions which must be handled. To tell if your solution is 'as good as' Gosper's, it must at least have this property: If you give it an eventually periodic configuration, it must be able to return the state of generation N in O(P), where P is the period. Note that you do not tell it that it is periodic, it must recognize this in O(P). Note that implementing Gosper's method is not a big deal - any sophomore level Data Structures/Fundamental Algorithms course would equip you for this. Later, Andrew Mullhaupt From cellular-automata-request@Think.COM Sun Feb 14 18:25:04 1993 Received: by mail.think.com; Sun, 14 Feb 93 18:25:06 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sun, 14 Feb 93 18:25:04 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sun, 14 Feb 93 18:25:01 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA20235; Sun, 14 Feb 93 18:02:26 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Sun, 14 Feb 93 22:44:59 GMT From: jbaez@riesz.mit.edu (John C. Baez) Organization: MIT Department of Mathematics, Cambridge, MA Subject: Re: This Week's Finds in Mathematical Physics Message-Id: <1993Feb14.224459.23788@galois.mit.edu> Newsgroups: sci.math,sci.physics,comp.theory.cell-automata References: Sender: ca-request@Think.COM To: ca@Think.COM In article aesop@freds.cojones.com (aesop) writes: > Is it surprising that the random initial state eventually settles >down to something periodic when one reapplies the same boring >rule-set ad infinitum? "Surprising" is something subjective, but as I mentioned before, there are plenty of cellular automata that act very differently from Life on average when starting with random initial conditions. E.g., Ising-type models are utterly aperiodic until they hit equilibrium, at which point they stay put. The time this takes grows rapidly with the size of the board. Lattice gases are periodic but the length of the period is immense and grows rapidly with the size of the board. They are, in some vague sense, close to ergodic. The Zhabotinsky-type cellular automata wind up being periodic but the whole board is engaged in a collective motion (sort of like a big heartbeat). Life, on the other hand, far from acting collectively, typically winds up as a bunch of very simple objects that are either static or period-2, which don't interact with each other. So, in short, it is interesting to ponder the various kinds of end states and perhaps prove something about the game of Life. From cellular-automata-request@Think.COM Mon Feb 15 10:25:21 1993 Received: by mail.think.com; Mon, 15 Feb 93 10:25:23 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 15 Feb 93 10:25:21 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 15 Feb 93 10:25:18 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA07840; Mon, 15 Feb 93 10:21:33 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Mon, 15 Feb 93 14:46:24 GMT From: man@graphics1 (Dipl.-Ing. M.A. Neuhauser) Organization: Department Of Mathematics and Computer Science Subject: Re: fractal inversion & perpetual motion Message-Id: <1993Feb15.144624.28238@rulway.LeidenUniv.nl> Newsgroups: comp.theory.cell-automata,sci.fractals References: , <1993Jan27.025406.23412@galois.mit.edu>, Sender: ca-request@Think.COM To: ca@Think.COM In article linas@boardhead.austin.ibm.com writes: >...[Stuff about `solution' of inverse problem by Barnsley and Hurd deleted] > >Duhhh, >Either I'm reallllly stupid, or I'm reallllly smart. >I got to thinking about this many years ago, and almost took >out a patent, but I figured ... why bother. > >One way (maybe not the best way) is: > > loop over scale factor (s = 1.0 to 0.0001) > loop over rotation (rot = 0 degrees to 360 degrees) > compute scaled-down and rotated version of original image > compute correlation between scaled-down & original image > end loop > end loop > > >What you've done is generate an auto-correlation type array -- >A sort-of self-correlated version of the Hough transform. >... Can you please explain what you mean exactly by "compute correlation", and from where do you get the translation vector of the transform, i.e., t in w(x) = M.x + t? At least I see a problem with affine functions that are not similitudes, i.e., that don't have the same scaling-factor in x and y direction. And if you consider such general affine transformations, you would have FOUR parameters to search for, because to describe any 2x2 Matrix a rotation, a scaling in x, one in y direction, and another rotation is needed. That will boost the computation time needed. So it don't look like a practical solution to me, but maybe I have missed something. I'm doing some research in this area and I would really appreciate anything that helps a step further. Kind regards, Michael Neuhauser (man@prip.tuwien.ac.at) From cellular-automata-request@Think.COM Mon Feb 22 16:26:40 1993 Received: by mail.think.com; Mon, 22 Feb 93 16:26:43 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 22 Feb 93 16:26:40 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 22 Feb 93 16:26:36 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA03364; Mon, 22 Feb 93 15:58:16 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 22 Feb 93 18:20:00 GMT From: mark_a@cix.compulink.co.uk (Mark Atkinson) Subject: k Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM >>>Keith >>>Ramsay mentioned the possibility of large "intelligent" configurations >>>that can defend themselves against crud they run into. But as far as I >>>know, none have been constructed, and I would conjecture that none >>>exist. Of course, they might simply be so large we can't fathom them. >>It's not hard to imagine whats needed. First you need a device that >>[.....] >>and anything else you want to do such as replicating itself. Such a >>configuration would probably need at least cells of order 1 million >>by 1 million[.....] J Baez writes: >This is a nice outline of an approach but I claim it can't be done. >I see no way to build an "outer shell to screen off most of the debris." >[.....] Nobody said it was _easy_, or even possible in any (current) practical sense, but I would argue that it could be done, in the very large array of cells hypothesized. I think the problem people have with thinking of real complex systems using a familiar CA like Life is one of scale. We're all used to ~1024x1024 and think of gliders like bacteria or something. Sure, at this level Life is a very fragile ruleset, but hypothetical computers or lifeforms (bigger) would exist on an entirely different scale. The gliders of Life should be thought of as more like subatomic particles - now what's fragile? The dynamics of the "physics" of Life are different from our own, but that's irrelevant; Life has been shown to be capable of Universal Computation and that's all the substrate you need to support "Life" in the conventional sense, however you choose to define it. No use arguing "so how do you do quantum mechanics in Life?". >The relevance of all this to physics is that it's actually rather >amazing, when you think of things this way, that stable organisms can >exist and not be quickly ruined by interactions with a random >environment. Of course, a) they *are* eventually ruined (death, >remember?) but simply reproduce fast enough to stick around, and b) they >certainly are not good at surviving in *arbitrary* environments. So to >be fair to Life, one should ask whether it admits complex >self-reproducing structures capable of surviving a "fairly wide" range >of environments. And it's also complicated by the fact that >"self-reproduction" need not mean *exact* self-reproduction. In any >event, I am convinced that quantum mechanics is crucial for permitting >the stable existence of solid objects composed of many parts interacting >locally. THe Quantum Theory, *excellent* though it is, is a Big Red Herring here. QM may be responsible for some macroscopic phenomena used by life-forms, but to argue it is a necessary prerequisite is bogus. Most lifeforms are specifically adapted to avoid the sort of random noise quantum-mechanical effect would introduce, no to mention the typical scale of lifeforms in our universe. Complex adaptive systems are, well, just that - any "suitable" physical system would almost inevtably produce lifeforms. I would define "suitable" as "capable of supporting universal computation" - this should certainly sufficient. A suitable environment is another matter (density of matter/energy/other, configuration, geometry etc.), but we are allowed to "design" that, yes? -=Mark=- ============================================================================= Mark Atkinson mark_a@cix.compulink.co.uk ----------------------------------------------------------------------------- "This statement is true, but you cannot prove it." - Kurt Godel. My opinions are shareware - if you like them, please fax me $25. ============================================================================= >>>MATRIX version 1.21c From cellular-automata-request@Think.COM Mon Feb 22 18:15:12 1993 Received: by mail.think.com; Mon, 22 Feb 93 18:15:17 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 22 Feb 93 18:15:12 -0500 Received: from optima.cs.arizona.edu by Early-Bird.Think.COM; Mon, 22 Feb 93 18:15:08 EST Received: from leibniz.cs.arizona.edu by optima.cs.arizona.edu (5.65c/15) via SMTP id AA22133; Mon, 22 Feb 1993 16:15:01 MST Date: Mon, 22 Feb 1993 16:14:59 MST From: "Richard Schroeppel" Message-Id: <199302222314.AA01306@leibniz.cs.arizona.edu> Received: by leibniz.cs.arizona.edu; Mon, 22 Feb 1993 16:14:59 MST To: ca@Think.COM Subject: self-reproduction in Conway Life I believe that a self-reproducing object can be built in Conway Life, with a size roughly around 1000^2, give or take a factor of 3. The time to reproduce is ~ 10^8 ticks, give or take a factor of 10. For protection against random junk, an (extra) defensive border of a few hundred blank cells, with 1% random blocks, should be adequate. The basic design follows Von Neumann: A construction arm reaches out, bends a few times, clears a construction area, and lays down glider guns and other objects based on instructions from the central CPU. The defensive border seems thin, but random Life junk isn't very agressive: Random active areas tend to die out, and travel slowly; they only emit occasional gliders; the gliders' mean-free-path is fifty steps or less. This defense *is* vulnerable to attack from an enemy glider stream, but the space would have to be moderately scarce before it's worth the trouble to wipe out your (relatively distant) neighbors. Rich Schroeppel rcs@cs.arizona.edu From cellular-automata-request@Think.COM Tue Feb 23 01:27:00 1993 Received: by mail.think.com; Tue, 23 Feb 93 01:27:03 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 23 Feb 93 01:27:00 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 23 Feb 93 01:26:57 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA15389; Tue, 23 Feb 93 00:52:19 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 23 Feb 1993 01:12:53 GMT From: jenna@ucscb.UCSC.EDU (Jenna W.Dea---catseye) Organization: University of California; Santa Cruz Subject: The Hodgepodge Machine Message-Id: <1mbtmmINNe0k@darkstar.UCSC.EDU> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM I am having a hard time, trying to find literature on The Hodgepodge Machine. The only article I have on it, is the one in Scienfitic American, 8/1988. I want to know what the significance of The Hodgepodge Machine is. One of the questions that one can ask about Hodge is that given the 'right' set of rules, can we create something 'living'? (right?) Also, what parameters are given to Hodge, such that it can imitate the belusov-zhabotinsky chemical reaction in such proximity? Has Hodge been able to imitate other reactions, or anything else? How was hodge studied before,and what studies are done on it today? When did M. Gerhardt and H. Schuster invent Hodge? If anyone can tell me more about Hodge, or give me pointers to literature on the topic, that will be great. Relevant CA detail that might help, is also welcome. Please send e-mail to: jenna@cats.ucsc.edu Thank you very much, Jenna W. Dea From cellular-automata-request@Think.COM Tue Feb 23 01:27:25 1993 Received: by mail.think.com; Tue, 23 Feb 93 01:27:35 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 23 Feb 93 01:27:25 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 23 Feb 93 01:27:14 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA15719; Tue, 23 Feb 93 01:08:51 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 23 Feb 93 01:53:55 GMT From: tomh@cybernet.cse.fau.edu (Tom Holroyd) Organization: Cybernet BBS, Boca Raton, Florida Subject: Re: k Message-Id: Newsgroups: comp.theory.cell-automata References: Sender: ca-request@Think.COM To: ca@Think.COM > >The relevance of all this to physics is that it's actually rather > >amazing, when you think of things this way, that stable organisms can > >exist and not be quickly ruined by interactions with a random > >environment. Of course, a) they *are* eventually ruined (death, > >remember?) but simply reproduce fast enough to stick around, and b) they > >certainly are not good at surviving in *arbitrary* environments. So to > >be fair to Life, one should ask whether it admits complex > >self-reproducing structures capable of surviving a "fairly wide" range > >of environments. And it's also complicated by the fact that > >"self-reproduction" need not mean *exact* self-reproduction. In any > >event, I am convinced that quantum mechanics is crucial for permitting > >the stable existence of solid objects composed of many parts interacting > >locally. Organisms are open systems, energy flows through them, they dissipate heat and create structure. I don't know much about QM, but I'm keen to guess. :-) I say it's more important for the system in question to be dissipative in order to be stable. Tom Holroyd Center for Complex Systems and Brain Sciences Florida Atlantic University tomh@bambi.ccs.fau.edu From cellular-automata-request@Think.COM Tue Feb 23 13:49:29 1993 Received: by mail.think.com; Tue, 23 Feb 93 13:49:31 -0500 Return-Path: Received: from Think.COM by mail.think.com; Tue, 23 Feb 93 13:49:29 -0500 Received: from sjsumcs.SJSU.EDU by Early-Bird.Think.COM; Tue, 23 Feb 93 13:49:19 EST Received: by sjsumcs.SJSU.EDU (5.65c/IDA-1.4.4) id AA16093; Tue, 23 Feb 1993 10:50:18 -0800 Date: Tue, 23 Feb 1993 10:50:18 -0800 From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker) Message-Id: <199302231850.AA16093@sjsumcs.SJSU.EDU> To: ca@Think.COM Subject: hodge Gerhardt, Schuster, and Tyson published "A Cellular Automaton Model of Excitable Media Including Curvature and Dispersion," in SCIENCE March 1990, vol 247, pp. 1563-1566. This is a somewhat more complicated rule than the Hodgepodge machine and is somewhat more "real" looking. The same authors have three further papers in Physica D 46 (1990) and Physica D 50 (1991). Mario Markus & Bednno Hess, "Isotropic Cellular Atuomaton fo MOdelling Excitable Media" in Letters to NATURE vol 347, Sept 6, 1990 includes some three-D reactions like this. There is a whole book about chemical and physical scroll patterns WAVES AND PATTERNS IN CHEMICAL AND BIOLOGICAL MEDIEA edited by Swinney and Krinsky for MIT --- this is actually Vol 49 of Physica D. Scroll reactions are something that 2D CA's "like" to do; I've observed them in many different kinds of rules. My comments on this, as well as demos of four different kinds of scroll rules can be found in the book and software: JAMES GLEICK'S CHAOS: THE SOFTWARE, which is still available from Autodesk. From cellular-automata-request@Think.COM Tue Feb 23 21:26:22 1993 Received: by mail.think.com; Tue, 23 Feb 93 21:26:24 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 23 Feb 93 21:26:22 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 23 Feb 93 21:26:18 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA12081; Tue, 23 Feb 93 19:58:43 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 23 Feb 93 21:37:59 GMT From: baez@guitar.ucr.edu (john baez) Organization: University of California, Riverside Subject: Re: k Message-Id: <26505@galaxy.ucr.edu> Newsgroups: comp.theory.cell-automata References: , Sender: ca-request@Think.COM To: ca@Think.COM In article tomh@cybernet.cse.fau.edu (Tom Holroyd) writes: >I don't know much about QM, but I'm keen to guess. :-) I say it's >more important for the system in question to be dissipative in order to be >stable. Sorry to sound like a broken record, but let me repeat: quantum mechanics was invented in part because it was realized that large conglomerates of matter would be severely unstable if the classical physics of the time were true. I'm not talking life here, I'm talking rocks. A classical hydrogen atom, for that matter, would self-destruct in less than a second (probably less than a microsecond; I don't remember the figures.) Of course one can hope for imaginary worlds - possibly discrete ones - that would allow robust objects made of smaller parts. But to the best of my knowledge no examples have yet been achieved - the so-called "solid body problem" for cellular automata. now, since they've been trying for years and haven't succeeded. Their failure is the basis for my conjecture that it's necessary. I'd be glad to see evidence either FOR or AGAINST this conjecture, I have no stake in it either way. From cellular-automata-request@Think.COM Tue Feb 23 21:26:26 1993 Received: by mail.think.com; Tue, 23 Feb 93 21:26:31 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 23 Feb 93 21:26:26 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 23 Feb 93 21:26:24 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA12087; Tue, 23 Feb 93 19:58:59 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 23 Feb 93 21:39:59 GMT From: baez@guitar.ucr.edu (john baez) Organization: University of California, Riverside Subject: Lisa Lancor wants information on computation Message-Id: <26506@galaxy.ucr.edu> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM I am posting this for Lisa Lancor, lisa@brc.uconn.edu, because she is unable to get this newsgroup. Therefore don't post your replies (if you want to help her) and don't send them to me. Send them directly to her. Dear John- I have just been informed about the comp.theory.cell-automata group and since I don't have access to the newsgroup, I was given your address to see if you might be able to help by posting this message to all your readers: I am looking for any software that can emulate the following Turing equivalent computational models listed below: 1. General recursive functions defined by equational calculus 2. \lambda-definable functions 3. \mu-recursive functions & partial recursive functions 4. functions defined by canonical deduction systems 5. functions defined by certain algorithms over a finite alphabet 6. URM-computable functions 7. S-rudimentary formulas Any suggestions to any such sources would be greatly appreciated!! Please send information directly to: Lisa Lancor lisa@brc.uconn.edu Thanks in advance!!! From cellular-automata-request@Think.COM Mon Mar 1 21:27:40 1993 Received: by mail.think.com; Mon, 1 Mar 93 21:27:43 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 1 Mar 93 21:27:40 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 1 Mar 93 21:27:33 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA02948; Mon, 1 Mar 93 20:52:57 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Mon, 1 Mar 1993 20:35:00 +0000 From: mark_a@cix.compulink.co.uk (Mark Atkinson) Subject: k Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM >>universe. Complex adaptive systems are, well, just that - any "suitable" >>physical system would almost inevtably produce lifeforms. >It's unscientific to present opinions as if they were fact, without even >any evidence. Your last sentence is a strong claim - it sounds nice, >but where are the facts backing it up? This stuff's all very difficult to _prove_. The sort of CA's were talking about are going to be large - too large to be either designed or evolved under current technology in a reasonable time scale. So, of course, what everybody has to say on this subject is going to be speculative - I don't think that's necessarily unscientific. The more you study aritificial life, cellular automata, or even conventional biological evolution, the more it becomes apparent (I hope) that's its the emergent properties of the systems involved, by virtue of their complexity and interaction, that are (likely to be) the important properties here. The encouraging part is that it doesn't seem hard to produce a system which shows complex emergent properties (Langton's "edge of chaos" lambda value is one good guideline...). This leads me, (among others :-), to believe that equally valid forms of "life" can exist under other systems. Although everything from the physics of our universe, to the environment on our planet, can be considered "special" inasmuch as they are capable of supporting life, this doesn't (in my opinion) make them either unique or invariant. Of course, I would love to be the one to prove all this first :-). I think it's refining the idea of "suitable" in my original statement from an intuitive idea to some concrete parameters that is going to be an important research task; by tightening our idea of the kind of system that is likely to evolve AL-forms, so we are improving our chances of seeing interesting behaviour sooner rather than later. >As for the possible need for quantum mechanics, try to simulate solid >bodies made of small parts that hang together stably without it. If you >succeed, let the folks at the MIT cellular automaton group know, since >they've been trying for years and haven't succeeded. Their failure is >the basis for my conjecture that it's necessary. I'd be glad to see >evidence either FOR or AGAINST this conjecture, I have no stake in it >either way. Perhaps I'm misinterpreting you, but I think it's slightly misleading to see quantum mechanics as some sort of bolt-on which holds matter together. Matter/energy *is* the macroscopic manifestation of these quantum effects. Trying to simulate matter, with 100% accuracy, without it isn't going to get very far :-). The point that I was trying to make is that any obsession with simulating the way things are in our universe could be a bad idea. What we need to do is try to divine the essential properties that we require. I believe e.g. an idealised "billiard ball" universe to have all the (speculated) necessary properties of complexity/interaction to support AL. I would be interested in hearing more on what the MIT CA group are trying to do. Is this directed towards AL or physical simulation? How are you classifying their failure, and has it been shown to be attributable to the lack of QM events in the system? Of course there's no reason why you can't have quantum events in your CA model - just attach you Geiger counter to your serial port, etc.... :-) -=Mark=- ============================================================================= Mark Atkinson mark_a@cix.compulink.co.uk ----------------------------------------------------------------------------- "This statement is true, but you cannot prove it." - Kurt Godel. My opinions are shareware - if you like them, please fax me $25. ============================================================================= >>>MATRIX version 1.21c From cellular-automata-request@Think.COM Tue Mar 2 03:28:43 1993 Received: by mail.think.com; Tue, 2 Mar 93 03:28:48 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 2 Mar 93 03:28:43 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 2 Mar 93 03:28:01 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA09987; Tue, 2 Mar 93 02:38:09 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 2 Mar 93 04:57:14 GMT From: dbell@pdact.pd.necisa.oz.au (David I. Bell) Organization: NEC Information Systems Australia, Canberra Subject: Spaceships in Conway's Life (Addendum 1a) Message-Id: <1993Mar02.045714.24332@pdact.pd.necisa.oz.au> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM Spaceships in Conway's Life (Addendum 1) by David I. Bell dbell@pdact.pd.necisa.oz.au 2 Mar 1993 This is an addendum to my series of articles concerning Conway's Game of Life. In this article, I will show the new results about spaceships that have been discovered since my series of articles was first posted in August through October of 1992. There have been new discoveries made in many of the categories of spaceships which I had reported on in my articles. The order of presentation in this article will be based on the period of the spaceship. So I will begin with the period 2 spaceships, and end with the large period spaceships. The vast majority of results in this article were found by Hartmut Holzwart. These are mostly period 2 and period 4 spaceships. (For period 4 spaceships, almost all the results are his.) I have contributed by finding some period 2 and period 3 spaceships, and working on large period spaceships. Dean Hickerson made a small but very significant contribution to these new results. So now I will begin with the new results for period 2 c/2 spaceships. Hartmut Holzwart found the following spaceship last September. One of his repeatable tagalongs from my article 2 has been slightly modified to allow two of them to connect together. This allows a spaceship to be constructed which is as long and as wide as desired, and is quite dense. [Dense period 2 spaceship (speed c/2)] ..............O................................... ...........OOOO................................... ...........OO..................................... .........O...OO................................... .........OOOO.O................................... ......O.O......................................... .....OOOOOO....................................... ....OO.....O...................................... ...OO....O........................................ ....OO...OO....................................... ..........OOO..................................... ....OO......O..................................... ...OO.O........................................... ..OO.............................................. .OO..O............................................ OO................................................ .OOOOO............................................ .................................................. .OOOOO............................................ OO................................................ .OO..O............................................ ..OO.............................................. ...OO.O........................................... ....OO............................................ .................................................. ....OO.............O.........O.........O.........O ...OO..OO........OOO.......OOO.......OOO.......OOO ..OO..OOO.......OO........OO........OO........OO.. .OOO.O..........O.........O.........O.........O... ..OO..OOO.....O.O.......O.O.......O.O.......O.O... ...OO..OO...OOO.......OOO.......OOO.......OOO..... ....OO.....OO.O......OO.O......OO.O......OO.O..... ...........O.O.OO....O.O.OO....O.O.OO....O.O.OO... ....OO.....OO..OO....OO..OO....OO..OO....OO..OO... ...OO..OO..O.....OO..O.....OO..O.....OO..O.....OO. ..OO..OOO..OO..OO.O..OO..OO.O..OO..OO.O..OO..OO.O. .OOO.O.....OO.O......OO.O......OO.O......OO.O..... ..OO..OOO..OO..OO.O..OO..OO.O..OO..OO.O..OO..OO.O. ...OO..OO..O.....OO..O.....OO..O.....OO..O.....OO. ....OO.....OO..OO....OO..OO....OO..OO....OO..OO... ...........O.O.OO....O.O.OO....O.O.OO....O.O.OO... ....OO.....OO.O......OO.O......OO.O......OO.O..... ...OO..OO...OOO.......OOO.......OOO.......OOO..... ..OO..OOO.....O.O.......O.O.......O.O.......O.O... .OOO.O..........O.........O.........O.........O... ..OO..OOO.....O.O.......O.O.......O.O.......O.O... ...OO..OO...OOO.......OOO.......OOO.......OOO..... ....OO.....OO.O......OO.O......OO.O......OO.O..... ...........O.O.OO....O.O.OO....O.O.OO....O.O.OO... ....OO.....OO..OO....OO..OO....OO..OO....OO..OO... ...OO..OO..O.....OO..O.....OO..O.....OO..O.....OO. ..OO..OOO..OO..OO.O..OO..OO.O..OO..OO.O..OO..OO.O. .OOO.O.....OO.O......OO.O......OO.O......OO.O..... ..OO..OOO..OO..OO.O..OO..OO.O..OO..OO.O..OO..OO.O. ...OO..OO..O.....OO..O.....OO..O.....OO..O.....OO. ....OO.....OO..OO....OO..OO....OO..OO....OO..OO... ...........O.O.OO....O.O.OO....O.O.OO....O.O.OO... ....OO.....OO.O......OO.O......OO.O......OO.O..... ...OO..OO...OOO.......OOO.......OOO.......OOO..... ..OO..OOO.....O.O.......O.O.......O.O.......O.O... .OOO.O..........O.........O.........O.........O... ..OO..OOO.....O.O.......O.O.......O.O.......O.O... ...OO..OO...OOO.......OOO.......OOO.......OOO..... ....OO.....OO.O......OO.O......OO.O......OO.O..... ...........O.O.OO....O.O.OO....O.O.OO....O.O.OO... ....OO.....OO..OO....OO..OO....OO..OO....OO..OO... ...OO..OO..O.....OO..O.....OO..O.....OO..O.....OO. ..OO..OOO..OO..OO.O..OO..OO.O..OO..OO.O..OO..OO.O. .OOO.O.....OO.O......OO.O......OO.O......OO.O..... ..OO..OOO..OO..OO.O..OO..OO.O..OO..OO.O..OO..OO.O. ...OO..OO..O.....OO..O.....OO..O.....OO..O.....OO. ....OO.....OO..OO....OO..OO....OO..OO....OO..OO... ...........O.O.OO....O.O.OO....O.O.OO....O.O.OO... ....OO.....OO.O......OO.O......OO.O......OO.O..... ...OO..OO...OOO.......OOO.......OOO.......OOO..... ..OO..OOO.....O.O.......O.O.......O.O.......O.O... .OOO.O..........O.........O.........O.........O... ..OO..OOO.......OO........OO........OO........OO.. ...OO..OO........OOO.......OOO.......OOO.......OOO ....OO.............O.........O.........O.........O .................................................. ....OO............................................ ...OO.O........................................... ..OO.............................................. .OO..O............................................ OO................................................ .OOOOO............................................ .................................................. .OOOOO............................................ OO................................................ .OO..O............................................ ..OO.............................................. ...OO.O........................................... ....OO......O..................................... ..........OOO..................................... ....OO...OO....................................... ...OO....O........................................ ....OO.....O...................................... .....OOOOOO....................................... ......O.O......................................... .........OOOO.O................................... .........O...OO................................... ...........OO..................................... ...........OOOO................................... ..............O................................... Hartmut also found two new "arm" components for period 2 spaceships. These arms are derived from the "glancing head" component, and have slopes of 5/17 and 5/13. The following spaceship shows two copies of both of these components. [Period 2 spaceship with arm components (speed c/2)] .............................O.O ............................O..O ...........................OO... ..........................O...O. .........................OOO.O.. ........................O....... .......................O..OOOO.. .......................O..O..... .......................OOO.OOO.. .........................OO..... ............................O... ..........................O..... ..........................OO.... ........................OOO..... .......................O...O.... ......................OO........ .....................O...O...... ....................OOO.O....... ...................O............ ..................O..OOOO....... ..................O..O.......... ..................OOO.OOO....... ....................OO.......... .......................O........ .....................O.......... .....................OO......... ...................OOO.......... ..................O...O......... .................OO............. ................O...O........... ...............OOO.O............ ..............O................. .............O..OOOO............ .............O..O............... .............OOO.OOO............ ...............OO............... ..................O............. ...............O.O.............. ..............OO................ ...............OO............... ................OOO............. .................O.............. ...................O............ ..............O.O.O............. .............O..O............... ............OO.................. ...........O...O................ ..........OOO.O................. .........O...................... ........O..OOOO................. ........O..O.................... ........OOO.OOO................. ..........OO.................... .............O.................. ..........O.O................... .........OO..................... ..........OO.................... ...........OOO.................. ............O................... ..............O................. .........O.O.O.................. ........O..O.................... .......OO....................... ......O......................... .....OOOOOO..................... ..OO.......O.................... .O...OOO.O...................... O...O....O...................... O.....O....O.................... OOO...OOOOO..................... ................................ OOO...OOOOO..................... O.....O....O.................... O...O....O...................... .O...OOO.O...................... ..OO.......O.................... .....OOOOOO..................... ......O......................... .......OO....................... ........O..O.................... .........O.O.................... Hartmut also found the following spaceship, which has repeatable glide- reflective wicks trailing from the ends. Between the two main components is a large repeatable component which is only a slightly modified version of Dean Hickerson's long period 2 spaceship. The central component was found using Hartmut's cylindrical search feature of the life search program. [Period 2 spaceship with glide-reflective wick and repeatable component (speed c/2)] ...............................................O........ ...................O.............O..........OO.O........ ................OOOO..........OOOO..........O........... ................OO............OO............O........... ............O.O...........O.O...........O.O............. ..........OO...OOOOO....OO...OOOOO....OO...OOO.......O.. ........OO...O........OO...O........OO...O.........OOO.. ........OOO.O..OOO.O..OOO.O..OOO.O..OOO.O..OOO....OO.... ......O........OO...O........OO...O........OO.O...O..... ......OOOOOOO....OO...OOOOO....OO...OOOOO....OO.....O... ...O.O.............O.O...........O.O..........OOOOOO.... ..OOOOOOO.O............OO............OO........O.O...... .OO.......O............OOOO..........OOOO.........OOOO.O OO....OO..................O.............O.........O...OO .OO....O.O..........................................OO.. ....................................................OOOO .OO....O.O.............................................O OO....OO.......O.O...................................... .OO.......O..O.O........................................ ..OOOOOOO.O.O.O...O..................................... ...O.O........OOO.O..................................... ......OOO.OO............................................ ......O...OO.OO......................................... ........OOO............................................. ........OOO............................................. ........................................................ ........OOO............................................. ........OOO............................................. ......O...OO.OO......................................... ......OOO.OO............................................ ...O.O........OOO.O..................................... ..OOOOOOO.O.O.O...O..................................... .OO.......O..O.O........................................ OO....OO.......O.O...................................... .OO....O.O.............................................. ........................................................ .OO....O.O.............................................. OO....OO.......O.O...................................... .OO.......O..O.O........................................ ..OOOOOOO.O.O.O...O..................................... ...O.O........OOO.O..................................... ......OOO.OO............................................ ......O...OO.OO......................................... ........OOO............................................. ........OOO............................................. ........................................................ ........OOO............................................. ........OOO............................................. ......O...OO.OO......................................... ......OOO.OO............................................ ...O.O........OOO.O..................................... ..OOOOOOO.O.O.O...O..................................... .OO.......O..O.O........................................ OO....OO.......O.O...................................... .OO....O.O.............................................O ....................................................OOOO .OO....O.O..........................................OO.. OO....OO..................O.............O.........O...OO .OO.......O............OOOO..........OOOO.........OOOO.O ..OOOOOOO.O............OO............OO........O.O...... ...O.O.............O.O...........O.O..........OOOOOO.... ......OOOOOOO....OO...OOOOO....OO...OOOOO....OO.....O... ......O........OO...O........OO...O........OO.O...O..... ........OOO.O..OOO.O..OOO.O..OOO.O..OOO.O..OOO....OO.... ........OO...O........OO...O........OO...O.........OOO.. ..........OO...OOOOO....OO...OOOOO....OO...OOO.......O.. ............O.O...........O.O...........O.O............. ................OO............OO............O........... ................OOOO..........OOOO..........O........... ...................O.............O..........OO.O........ ...............................................O........ Hartmut's cylindrical search also found several other repeatable components related to the one in the above spaceship. Most of these join each other in the same manner in one spot. [Period 2 spaceship demonstrating several repeating components (speed c/2)] .............O......... ...........OO.......... ........OOOO.O......... ........OO............. ......O...OO.O......... ......OOOO.O.O.OO...... ...O.O......OO......... ..OOOOOO.OO.OO.O....O.. .OO.....OO...O...OOOO.. OO....OO....O....OO.... .OO....OOOO............ ....................... .OO....OOOO............ OO....OO....O....OO.... .OO.....OO...O...OOOO.. ..OOOOOO.OO.OO.O....O.. ...O.O......OO......... ......OOOO.O.O.OO...... ......O...OO.O......... ........OOO............ ........OOO............ ....................... ........OOO............ ........OOO......OO.... ......O...OO.O...OOOO.. ......OOOO.O.O.O....O.. ...O.O......OO......... ..OOOOOO.OO.OO.OO...... .OO.....OO...O......... OO....OO....O.......... .OO....OOOO............ ....................... .OO....OOOO............ OO....OO....O.........O .OO.....OO...O.....OOOO ..OOOOOO.OO.OO.....OO.. ...O.O......OO.O.O..... ......OOOO.O.O.OO.OO.O. ......O...OO..O..OO.O.O ........OOO..OO....OO.. ........OOO...O.OOO.O.. ....................... ........OOO...O.OOO.O.. ........OOO..OO....OO.. ......O...OO..O..OO.O.O ......OOOO.O.O.OO.OO.O. ...O.O......OO.O.O..... ..OOOOOO.OO.OO.....OO.. .OO.....OO...O.....OOOO OO....OO....O.........O .OO....OOOO............ ....................... .OO....OOOO............ OO....OO....O.......... .OO.....OO...O......... ..OOOOOO.OO.OO.OO...... ...O.O......OO......... ......OOOO.O.O.O....O.. ......O...OO.O...OOOO.. ........OOO......OO.... ........OOO............ ....................... ........OOO............ ........OOO............ ......O...OO.O......... ......OOOO.O.O...O.O... ...O.O......OO.OO..O... ..OOOOOO.OO.OO.OO...... .OO.....OO...O....O.... OO....OO....O..OO...... .OO....OOOO....OOO..... ....................... .OO....OOOO....OOO..... OO....OO....O..OO...... .OO.....OO...O....O.... ..OOOOOO.OO.OO.OO...... ...O.O......OO.OO..O... ......OOOO.O.O...O.O... ......O...OO.O......... ........OOO............ ........OOO............ ....................... ........OOO............ ........OOO............ ......O...OO.O......... ......OOOO.O.O......... ...O.O......OO.OO..O... ..OOOOOO.OO.OO.OO..O... .OO.....OO...O....O.... OO....OO....O..OO...... .OO....OOOO....OOO..... ....................... .OO....OOOO....OOO..... OO....OO....O..OO...... .OO.....OO...O....O.... ..OOOOOO.OO.OO.OO..O... ...O.O......OO.OO..O... ......OOOO.O.O......... ......O...OO.O......... ........OOO............ ........OOO............ ....................... ........OOO............ ........OOO........O.O. ......O...OO.O....O..O. ......OOOO.O.O.O.OO.... ...O.O......OO......... ..OOOOOO.OO.OO.OOOOOO.O .OO.....OO...O...O...OO OO....OO....O......OOO. .OO....OOOO........OOO. ....................... .OO....OOOO........OOO. OO....OO....O......OOO. .OO.....OO...O...O...OO ..OOOOOO.OO.OO.OOOOOO.O ...O.O......OO......... ......OOOO.O.O.O.OO.... ......O...OO.O....O..O. ........OOO........O.O. ........OOO............ ....................... ........OOO............ ........OOO............ ......O...OO.O......... ......OOOO.O.O.OO...... ...O.O......OO......... ..OOOOOO.OO.OO.O....O.. .OO.....OO...O...OOOO.. OO....OO....O....OO.... .OO....OOOO............ ....................... .OO....OOOO............ OO....OO....O......O.O. .OO.....OO...O....O..O. ..OOOOOO.OO.OO.O.OO.... ...O.O......OO......... ......OOOO.O.O.OOOOOO.O ......O...OO.O...O...OO ........OOO........OOO. ........OOO........OOO. ....................... ........OOO........OOO. ........OOO........OOO. ......O...OO.O...O...OO ......OOOO.O.O.OOOOOO.O ...O.O......OO......... ..OOOOOO.OO.OO.O.OO.... .OO.....OO...O....O..O. OO....OO....O......O.O. .OO....OOOO............ ....................... .OO....OOOO............ OO....OO....O....OO.... .OO.....OO...O...OOOO.. ..OOOOOO.OO.OO.O....O.. ...O.O......OO......... ......OOOO.O.O.OO...... ......O...OO.O......... ........OO............. ........OOOO.O......... ...........OO.......... .............O......... Hartmut looked for period 2 spaceships with even symmetry, and found that there are no spaceships with a width less than 28. The smallest minimum width spaceship which has even symmetry is the following. Removing one of the two middle rows will produce a spaceship with odd symmetry (but not the one of minimum width). [Period 2 spaceship with even symmetry of minimum width 28 (speed c/2)] .........O.O ........O..O .......OO... ......O....O .....OOOOO.O ..OO........ .O...OOO.... O...O....... O.....O..... O..O..O..... .O.O..OO.O.. .........O.. OOO......... OO.......... OO.......... OOO......... .........O.. .O.O..OO.O.. O..O..O..... O.....O..... O...O....... .O...OOO.... ..OO........ .....OOOOO.O ......O....O .......OO... ........O..O .........O.O Hartmut found several modifications and tagalongs for the above spaceship. Two of these are shown below. [Period 2 spaceship with large tagalongs (speed c/2)] .........OO.................O..... ........O...............OO.OO..O.. .......OO..O...........O.....O.O.. ......O....O..........OO..OO...... .....OOOOO...........O............ ..OO.....OO....O....OOO.OO.O.....O .O...OOO..O..OOO...O.....O....OOOO O...O.....OO.OO...OOO....OO...OO.. O.....O...O...O..O.....OO...O..... O..O..O.....OOO.OOO....O..OO...... .O.O..OO.O..OO.....O...O.O........ .........O.....OOO.........OOO.... OOO............OO.....OOO..O..O... OO...............O....OO...OO..... OO...............O....OO...OO..... OOO............OO.....OOO..O..O... .........O.....OOO.........OOO.... .O.O..OO.O..OO.....O...O.O........ O..O..O.....OOO.OOO....O..OO...... O.....O...O...O..O.....OO...O..... O...O.....OO.OO...OOO....OO...OO.. .O...OOO..O..OOO...O.....O....OOOO ..OO.....OO....O....OOO.OO.O.....O .....OOOOO...........O............ ......O....O..........OO..OO...... .......OO..O...........O.....O.O.. ........O...............OO.OO..O.. .........OO.................O..... .........OO.................O........... ........O...............OO.OO..O........ .......OO..O...........O.....O.O........ ......O....O..........OO..OO............ .....OOOOO...........O.................O ..OO.....OO....O....OOO.OO.O.....O.O.OO. .O...OOO..O..OOO...O.....O....OOOO.O.O.O O...O.....OO.OO...OOO....OO...OO..O..... O.....O...O...O..O.....OO...O.....OOO... O..O..O.....OOO.OOO....O..OO......O..... .O.O..OO.O..OO.....O...O.O........O.O... .........O.....OOO.........OOO.......... OOO............OO.....OOO..O..O..OOO.... OO...............O....OO...OO....OO..... OO...............O....OO...OO....OO..... OOO............OO.....OOO..O..O..OOO.... .........O.....OOO.........OOO.......... .O.O..OO.O..OO.....O...O.O........O.O... O..O..O.....OOO.OOO....O..OO......O..... O.....O...O...O..O.....OO...O.....OOO... O...O.....OO.OO...OOO....OO...OO..O..... .O...OOO..O..OOO...O.....O....OOOO.O.O.O ..OO.....OO....O....OOO.OO.O.....O.O.OO. .....OOOOO...........O.................O ......O....O..........OO..OO............ .......OO..O...........O.....O.O........ ........O...............OO.OO..O........ .........OO.................O........... The second spaceship above differs by the addition of a short wide tagalong which attaches to the feet of the previous tagalong. This tagalong can also be used in other spaceships where the feet appear, to join the two spaceships. For example, an odd-symmetrical version of the tagalong is shown below which joins two old spaceships. [Period 2 spaceships joined by bridging tagalong (speed c/2)] .............O............. ...........OO.............. ........OOOO.O............. ........OO.......OO........ ......O...OO.O...OOOO...... ......OOOO.O.O.O....O...... ...O.O......OO............. ..OOOOOO.OO.OO.OO.......... .OO.....OO...O............. OO....OO....O.............. .OO....OOOO................ ........................... .OO....OOOO................ OO....OO....O.............. .OO.....OO...O............. ..OOOOOO.OO.OO.OO.......... ...O.O......OO............O ......OOOO.O.O.O....O.O.OO. ......O...OO.O...OOOO.O.O.O ........OO.......OO..O..... ........OOOO.O.......OOO... ...........OO........O..... .............O.......O.O... ........................... ....................OOO.... ....................OO..... ....................OOO.... ........................... .............O.......O.O... ...........OO........O..... ........OOOO.O.......OOO... ........OO.......OO..O..... ......O...OO.O...OOOO.O.O.O ......OOOO.O.O.O....O.O.OO. ...O.O......OO............O ..OOOOOO.OO.OO.OO.......... .OO.....OO...O............. OO....OO....O.............. .OO....OOOO................ ........................... .OO....OOOO................ OO....OO....O.............. .OO.....OO...O............. ..OOOOOO.OO.OO.OO.......... ...O.O......OO............. ......OOOO.O.O.O....O...... ......O...OO.O...OOOO...... ........OO.......OO........ ........OOOO.O............. ...........OO.............. .............O............. In one of Hartmut's results there appeared an L-shaped repeating component which is very small and simple. I was asked to "tame" it by finding components which terminated the two ends. Amazingly, the component that I found for the front of the L components connects to them on both of its sides. The following spaceship shows the front component, two arms made of the L components, and the back component that I found. Also shown is one of a number of "feet" which can be attached to the L component. [Period 2 spaceship with simple "L" arms (speed c/2)] ............................O .........................OOOO .........................OO.. .......................O...OO .......................OOOO.O ....................O.O...... ...................OOOOOO.... ..................OO.....O... .................OO....O..... ..................O.O..OO.... ........................OOO.. ..................OO......O.. .................O........... .................OOO......... ...............O............. ...............OOO........... .............O............... .............OOO............. ...........O................. ...........OOO............... .........O................... .........OOO................. .......O.....OO.............. .......OOO...OOOO............ .....O..........O............ .....OOO..................... ...O......................... ...OOO....................... ..O.......................... .OOO.O....................... .O........................... .OOOOO....................... ........O.O.................. .O.O...O..O.................. OO....OO..................... .OO......O................... ..OOOOO.O.................... ...O.O....................... ......OOO.................... ......O...................... ........OOO.................. ........O.................... ..........OOO................ ..........O.................. ............OOO.............. ............O................ ..............OOO............ ..............O.............. ...............OO......O..... .....................OOO..... ...............O.O..OO....... ..............OO....O........ ...............OO.....O...... ................OOOOOO....... .................O.O......... ....................OOOO.O... ....................O...OO... ......................OO..... ......................OOOO... .........................O... I did not find a front component for a single arm of the L components. But I did find that the L component can be connected to the standard component that connects to the feet of many period 2 spaceships. This is shown below, where the L arm is connected to the back foot of the wicktrailer on a base spaceship. [Period 2 spaceship with L arm component connection (speed c/2)] ............................O..................... .............O...........OOOO..................... ...........OO..........OOO.O...................... ........OOOO.O........OO...O...................... ........OO.......OO...O....OO..................... ......O...OO.O...OOOO.O.....OOO.O................. ......OOOO.O.O.O....OOOO......O.O................. ...O.O......OO.........O........OO................ ..OOOOOO.OO.OO.OO..............OO................. .OO.....OO...O................O..O................ OO....OO....O................O.................... .OO....OOOO..................O.................... .............................OOO.................. .OO....OOOO...................O................... OO....OO....O.................OOOO................ .OO.....OO...O...............O....O............... ..OOOOOO.OO.OO.OO.............O.O................. ...O.O......OO................O...O............... ......OOOO.O.O.O....O..........OOO................ ......O...OO.O...OOOO...........O................. ........OO.......OO..............OOO.............. ........OOOO.O....................O............... ...........OO......................OOO............ .............O......................O............. .....................................OOO.......... ......................................O........... .......................................O.......O.. .......................................O....OO.O.. ......................................OOO...O..... ......................................O.....O..... ......................................O...O....... .......................................O...OOO.... ........................................OO........ ...........................................OOOOO.O ............................................O....O .............................................OO... ..............................................O..O ...............................................O.O I found another very messy connection of the L component to the feet of period 2 spaceships. This is illustrated below. The almost-symmetrical component in the middle is interesting, for it appears that it might be made larger somehow. But this has not been done yet. [Messy connection of L component with base period 2 spaceship (speed c/2)] .........................O ......................OOOO ......................OO.. ....................O...OO ....................OOOO.O .................O.O...... ................OOOOOO.... ...............OO.....O... ..............OO....O..... ...............O.O..OO.... .....................OOO.. ...............OO......O.. ..............O........... ..............OOO......... ............O............. ............OOO........... ..........O............... ..........OOO............. ........O................. ........OOO............... .......O.................. ......OOO.O............... ......O................... ......OOOOO............... .............O.O.......... ......O.O...O..O.......... .....OO....OO............. ......OO.................. .......OOOOOOOO........... ........O.O....O.......... ..........OO.O............ ..........O..O............ ...............O.......... ..........OOOOO........... .........OO............... ........OO..OOO........... .......OOO.O...O.......... ........OO..OO............ .........OO....O.......... ..........OOOO.O.......... ..............O........... ........OOOO.O.O.......... .......OO...OO............ ......OO..OO...O.......... .....OOO..OOOO.O.......... ......O......O.O.......... .......O.................. .......O.................. ......OOO................. ......O................... ......O................... .......O..O............... ........OO................ .........OO............... .......O.O................ ....OOOO.O................ ....OO.................... ..O....................... ..OOOO.................... .O........................ OOO..O.................... .OOO...................... ..O....................... ...OOO.O.................. ...O..OO.................. ....OOO................... ......O................... ....O..................... ....O.O................... ...O...................... ....O.O................... ....O..................... ......O................... ....OOO................... ...O..OO.................. ...OOO.O.................. ..O....................... .OOO...................... OOO..O.................... .O........................ ..OOOO.................... ..O....................... ....OO.................... ....OOOO.................. .......O.................. I found another "barber pole" component for period 2 spaceships. Like the previous barber pole component, this one appears the same in both phases, only shifted. The effect is not as obvious in this example, however, since the component is so large. The component can have feet attached to it at many places, as is shown below. [Period 2 spaceship with "barber pole" repeating component (speed c/2)] .................O... ..............OOOO... ..............OO..... ............O........ ............OOOO..... ...........O......... ..........OOO..O..... ...........OOO....... ............O........ .............OOO.O... .............O..OO... ..............OOO.... ................O.... ..............O...... ..............O.O.... .............O....... ..............O.O.... ..............O...... ................O.... ..............OOO.... .............O..OO... .............OOO.O... ............O........ ...........OOO....... ..........OOO..O..... ...........O......... ............OOOO..... ............O........ ..............OO..... ..............OOOO.O. .................O.O. ...................OO ..................OO. .................O..O ................O.... ................O.... ................O.... .................OO.. ..................... .................O.O. ................OO..O ................O.O.. ................OO... ................O.... ...............OOO... ...............O..O.. ..............O..O... ..............OO..... ..................... ..............O.O.... .............OO..O... .............O.O..... .............OO...... .............O....... ............OOO...... ............O..O..... ...........O..O...... ...........OO........ ..................... ...........O.O....... ..........OO..O...... ..........O.O...OO... ..........OO....OOOO. ..........O........O. .........OOO......... .........O..O........ ........O..O......... ........OO........... ..................... ........O.O.......... .......OO..O......... .......O.O........... .......OO............ .......O............. ......OOO............ ......O.............. ......O.............. .......O..O.......... ........OO........... .........OO.......... .......O.O........... ....OOOO.O........... ....OO............... ..O.................. ..OOOO............... .O................... OOO..O............... .OOO................. ..O.................. ...OOO.O............. ...O..OO............. ....OOO.............. ......O.............. ....O................ ....O.O.............. ...O................. ....O.O.............. ....O................ ......O.............. ....OOO.............. ...O..OO............. ...OOO.O............. ..O.................. .OOO................. OOO..O............... .O................... ..OOOO............... ..O.................. ....OO............... ....OOOO............. .......O............. That was a summary of the new developments for period 2 spaceships. Now I will move on to period 3 c/3 spaceships. There are not many new results to report for period 3 spaceships. All of these results were found by me. From cellular-automata-request@Think.COM Tue Mar 2 03:29:12 1993 Received: by mail.think.com; Tue, 2 Mar 93 03:29:21 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 2 Mar 93 03:29:12 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 2 Mar 93 03:28:43 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA10092; Tue, 2 Mar 93 02:42:37 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 2 Mar 93 04:58:02 GMT From: dbell@pdact.pd.necisa.oz.au (David I. Bell) Organization: NEC Information Systems Australia, Canberra Subject: Spaceships in Conway's Life (Addendum 1b) Message-Id: <1993Mar02.045802.24394@pdact.pd.necisa.oz.au> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM Ever since I found the period 9 tail to period 3 c/3 spaceships, I have wanted to turn that tail into a small component compatible with the rest of Dean Hickerson's period 3 grammar. At the beginning of 1993, I finally succeeded. The resulting spaceship is shown below. [Period 9 tail connecting to period 3 components (speed c/3)] .......O...... ......O.O..... ......O.O..... ......O....... .....OO....... .....O.O...... .............. ....OOO....... ....OO........ .............. ......OOO..... .....O.OO..... ....O......... ....O......... ...OOO........ ..O........... ..O..O........ ..O..OO....... .....O........ ....OO........ .....OO....... ..O.....O..... ..O..O.O...... .O.O..O....... OOO........... ....OOO.O..... ...OOO..O..... .OO........... .OOO.......... .............. .O.O.......... .O.O.......... .O..OO........ ..O.OO........ ..O........... ....O......... ..OOO......... ..OOO......... ......OO...... ......OOO..... .............. ......OOO..... ...O..O....... ..O.O.O....... .O..O.O.O..... ..O...O....... ...OO......... ..OO...O...... .OOOOO........ .O...OOO...... ...O.......... ...OO......... .............. ..O..O........ ..O..OO....... .OO...O....... .O....O....... .OO.OOO....... ..O...O....... ..OO...OO..... ...O.OOO.....O ....OO.O....OO ......O...O.O. ......OOOO..O. ............O. ............O. ............O. ......OOOO..O. ......O...O.O. ....OO.O....OO ...O.OOO.....O ..OO...OO..... ..O...O....... .OO.OOO....... .O....O....... .OO...O....... ..O..OO....... ..O..O........ .............. ...OO......... ...O.......... .O...OOO...... .OOOOO........ ..OO...O...... ...OO......... ..O...O....... .O..O.O.O..... ..O.O.O....... ...O..O....... ......OOO..... .............. ......OOO..... ......OO...... ..OOO......... ..OOO......... ....O......... ..O........... ..O.OO........ .O..OO........ .O.O.......... .O.O.......... .............. .OOO.......... .OO........... ...OOO..O..... ....OOO.O..... OOO........... .O.O..O....... ..O..O.O...... ..O.....O..... .....OO....... ....OO........ .....O........ ..O..OO....... ..O..O........ ..O........... ...OOO........ ....O......... ....O......... .....O.OO..... ......OOO..... .............. ....OO........ ....OOO....... .............. .....O.O...... .....OO....... ......O....... ......O.O..... ......O.O..... .......O...... This is a large solution to the problem, however. It only connects to Dean's grammar at about 13 cells from either end. The rest of it is made up of new components. I then looked for a smaller solution. The following shows two things. Firstly, a shorter arm is demonstrated which connects to the p9 component. This is seen at the top and bottom. The component has the same two-bit spark as is produced by Dean's "turtle" spaceship. Secondly, between two copies of the period 9 component is a large symmetrical component. Using this you can make a wide spaceship with as many period 9 components in it as you want. [Period 3 spaceship with several period 9 components (speed c/3)] ...O......... ..O.O........ .OO.......... ...O......... .OO.......... .OOO......... ............. ..O.O........ ..OOO........ ............. .....OOO..... .....OOO..... ............. ....OO....... ....OO....... ......O...... ............. ...OOO....... ...O.OO...... ......O...... ..OOO.O...... .O....O...... .OO.OOO...... OO.O..O...... ....OO....... .O..OO....... .O..O........ .O.OO........ ..O.OO.O..... .....O.O..... ............. .....OO...... ....O..O..... ...OOO....... .......O..... ......O...... ..O.......... .OO.O........ .O..OO....... OO...O....... O....O....... OO.OOO....... .O...O....... .OO...OO..... ..O.OOO.....O ...OO.O....OO .....O...O.O. .....OOOO..O. ...........O. ...........O. ...........O. .....OOOO..O. .....O...O.O. ...OO.O....OO ..O.OOO.....O .OO...OO..... .O...O....... OO.OOO....... O....O....... OO...O....... .O..OO....... .OO.O........ ..O.......... ......O...... .......O..... ...OOO....... ....O..O..... .....OO...... ............. .....O.O..... ..O.OO.O..... .O.OO........ .O..O........ .O..OO....... ...OO........ OO..OO....... .OO.......... ..OOOO....... ......O...... ..OOO........ OO....O...... OO..O.O...... O..O......... OO.OOO....... ....OO....... ..O...OO..... ..O.OOOO..... ..O.......... ...O......... ....OOO...... ...OO.O...... ..O.......... .O..O........ ..O.OOO...... ............. ..OOO........ ...OOO.O..... .....O....... .....O....... .....OO...... ............. .....OO...... .....O....... .....O....... ...OOO.O..... ..OOO........ ............. ..O.OOO...... .O..O........ ..O.......... ...OO.O...... ....OOO...... ...O......... ..O.......... ..O.OOOO..... ..O...OO..... ....OO....... OO.OOO....... O..O......... OO..O.O...... OO....O...... ..OOO........ ......O...... ..OOOO....... .OO.......... OO..OO....... ...OO........ .O..OO....... .O..O........ .O.OO........ ..O.OO.O..... .....O.O..... ............. .....OO...... ....O..O..... ...OOO....... .......O..... ......O...... ..O.......... .OO.O........ .O..OO....... OO...O....... O....O....... OO.OOO....... .O...O....... .OO...OO..... ..O.OOO.....O ...OO.O....OO .....O...O.O. .....OOOO..O. ...........O. ...........O. ...........O. .....OOOO..O. .....O...O.O. ...OO.O....OO ..O.OOO.....O .OO...OO..... .O...O....... OO.OOO....... O....O....... OO...O....... .O..OO....... .OO.O........ ..O.......... ......O...... .......O..... ...OOO....... ....O..O..... .....OO...... ............. .....O.O..... ..O.OO.O..... .O.OO........ .O..O........ .O..OO....... ....OO....... OO.O..O...... .OO.OOO...... .O....O...... ..OOO.O...... ......O...... ...O.OO...... ...OOO....... ............. ......O...... ....OO....... ....OO....... ............. .....OOO..... .....OOO..... ............. ..OOO........ ..O.O........ ............. .OOO......... .OO.......... ...O......... .OO.......... ..O.O........ ...O......... The structure of the middle 3 rows in the above spaceship intrigued me, and I then looked for more components that joined in that same manner. The following shows the results. At the top is the smallest terminating component that contains that connection (about 20 rows). Below that is a symmetrical component which includes a middle piece which is also in some period 2 spaceships, but which here acts as period 3 (about 26 rows). Below that is another symmetrical component (about 40 rows). And at the bottom is another copy of the termination component. [Period 3 spaceship with components connected in common manner (speed c/3)] ....O.. ...O.O. ..OO... ...O... ..O.O.. ..O.... .O..... .O.O... .O.O... ..OOOO. ....O.O ....O.O ...O... ...OOO. .O..... .OOO... ..OOO.O ....O.. ....O.. ....OO. ....... ....OO. ....O.. ....O.. ..OOO.O .OOO... ....... .O.OOO. O..O... .O.O... ..O..OO .....OO ....OO. ...O.O. ..O.... ...O.O. ....OO. .....OO ..O..OO .O.O... O..O... .O.OOO. ....... .OOO... ..OOO.O ....O.. ....O.. ....OO. ....... ....OO. ....O.. ....O.. ..OOO.O .OOO... ....... .O.OOO. O..O... .O.O... ..O..OO .....OO ....OO. ...O.O. ...O... ..O..O. ..OOO.O .O..O.. ..OOOOO ..O..O. ...OOOO .OO.... ...OOOO ..O..O. ..OOOOO .O..O.. ..OOO.O ..O..O. ...O... ...O.O. ....OO. .....OO ..O..OO .O.O... O..O... .O.OOO. ....... .OOO... ..OOO.O ....O.. ....O.. ....OO. ....... ....OO. ....O.. ....O.. ..OOO.O .OOO... .O..... ...OOO. ...O... ....O.O ....O.O ..OOOO. .O.O... .O.O... .O..... ..O.... ..O.O.. ...O... ..OO... ...O.O. ....O.. A few months ago Hartmut Holzwart did a little searching for cylindrical components for period 3 spaceships. He found an interesting partial result, but could not finish it. Recently I looked at it and found a way to tame it. Here is the finished object. It is a dense c/3 spaceship, which can be made as wide and as long as desired. Hartmut had found both of the repeatable components in the center. The thin stabilizing pieces on the sides of the front are just the terminating component of the spaceship shown above. At least one column of the repeating tagalongs is required to stabilize the front of the spaceship. So here is a case where the first column of tagalongs aren't really tagalongs, but extra copies of the same component are! [Dense period 3 spaceship (speed c/3)] ....O .............................................................. ...O.O.............................................................. ..OO................................................................ ...O................................................................ ..O.O............................................................... ..O................................................................. .O.................................................................. .O.O................................................................ .O.O................................................................ ..OOOO.............................................................. ....O.O............................................................. ....O.O............................................................. ...O................................................................ ...OOO.............................................................. .O.................................................................. .OOO................................................................ ..OOO.O............................................................. ....O............................................................... ....O............................................................... ....OO.............................................................. .................................................................... ....OO.....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O. ....O..O..O...O..OO...O...O..OO...O...O..OO...O...O..OO...O...O..OO. ....O.OO.O.....O.....O.....O.....O.....O.....O.....O.....O.....O.... .....OOO..O......O.O..O......O.O..O......O.O..O......O.O..O......O.O .....OO.....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O .......O...O...O.......O...O.......O...O.......O...O.......O...O.... .....OO....O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O ......O.O..O...........O...........O...........O...........O........ .......O....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO .................................................................... .......O....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO ......O.O..O...........O...........O...........O...........O........ .....OO....O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O .......O...O...O.......O...O.......O...O.......O...O.......O...O.... .....OO.....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O .....OOO..O......O.O..O......O.O..O......O.O..O......O.O..O......O.O ....O.OO.O.....O.....O.....O.....O.....O.....O.....O.....O.....O.... ....O..O..O...O..OO...O...O..OO...O...O..OO...O...O..OO...O...O..OO. ....OO.....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O. .................................................................... ....OO.....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O. ....O..O..O...O..OO...O...O..OO...O...O..OO...O...O..OO...O...O..OO. ....O.OO.O.....O.....O.....O.....O.....O.....O.....O.....O.....O.... .....OOO..O......O.O..O......O.O..O......O.O..O......O.O..O......O.O .....OO.....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O .......O...O...O.......O...O.......O...O.......O...O.......O...O.... .....OO....O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O ......O.O..O...........O...........O...........O...........O........ .......O....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO .................................................................... .......O....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO ......O.O..O...........O...........O...........O...........O........ .....OO....O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O .......O...O...O.......O...O.......O...O.......O...O.......O...O.... .....OO.....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O .....OOO..O......O.O..O......O.O..O......O.O..O......O.O..O......O.O ....O.OO.O.....O.....O.....O.....O.....O.....O.....O.....O.....O.... ....O..O..O...O..OO...O...O..OO...O...O..OO...O...O..OO...O...O..OO. ....OO.....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O. .................................................................... ....OO.....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O. ....O..O..O...O..OO...O...O..OO...O...O..OO...O...O..OO...O...O..OO. ....O.OO.O.....O.....O.....O.....O.....O.....O.....O.....O.....O.... .....OOO..O......O.O..O......O.O..O......O.O..O......O.O..O......O.O .....OO.....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O .......O...O...O.......O...O.......O...O.......O...O.......O...O.... .....OO....O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O ......O.O..O...........O...........O...........O...........O........ .......O....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO .................................................................... .......O....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO....OOOOOOOO ......O.O..O...........O...........O...........O...........O........ .....OO....O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O...O.OOO...O .......O...O...O.......O...O.......O...O.......O...O.......O...O.... .....OO.....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O....OO..OO.O .....OOO..O......O.O..O......O.O..O......O.O..O......O.O..O......O.O ....O.OO.O.....O.....O.....O.....O.....O.....O.....O.....O.....O.... ....O..O..O...O..OO...O...O..OO...O...O..OO...O...O..OO...O...O..OO. ....OO.....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O....OO.O.O.O. .................................................................... ....OO.............................................................. ....O............................................................... ....O............................................................... ..OOO.O............................................................. .OOO................................................................ .O.................................................................. ...OOO.............................................................. ...O................................................................ ....O.O............................................................. ....O.O............................................................. ..OOOO.............................................................. .O.O................................................................ .O.O................................................................ .O.................................................................. ..O................................................................. ..O.O............................................................... ...O................................................................ ..OO................................................................ ...O.O.............................................................. ....O............................................................... The rows containing long strings of ON cells can be slid with respect to each other left or right by 2 cells, and the spaceship will still work. I searched for a way to tame one copy of the front component of the above spaceship, without needing the required tagalong. This is shown below. [Period 3 spaceship with required tail (speed c/3)] ....O.................................... ...O.O................................... ...O.O................................... ...O..................................... ..OO..................................... ..O.O.................................... ......................................... .OOO..................................... .OOO..................................... ......................................... ....OOO.................................. ....OO................................... ......................................... ...OOO................................... ..O..O................................... .OOO.OO.................................. ....OOO.................................. ......................................... ....O.................................... ....OOO.....O............................ ...........O..O..........O............... ....OOO...OO...O..OO....OO............... ....O.....OO...O..OO..OOOOO.OOO.......O.O .....OO.OO........OO.O........O.O...O..O. .....OO....O..O.OOOO.O.O..OO....O.O.O..OO ...........O..OO......O....O..OOO........ ......O.....OO.O............O............ ......O.O................................ ......O.O................................ .......O................................. The last 19 columns of this spaceship are the same as the back component of the weaving wicktrailer shown in article 3 that connects to the "turtle" spaceship. So the tail of this spaceship can be made arbitrarily long by inserting more components of that wicktrailer before the end. Unfortunately, the completion crosses the line between the two rows of 3 cells at the front. So the bottom part of this spaceship cannot be used to terminate itself symmetrically, or be placed at the edges of the dense c/3 spaceship. But if an extension component from one of the previously shown spaceships is inserted between the two rows of 3 cells, then there is room to do these things. For example: [Period 3 spaceship with parts connected by extension component (speed c/3)] ........O................................. .......O.O................................ ......OO.................................. ........O....OO.O...............O......... ......OO....O.....OO...O...OOO..OOO....... ......OOO..O...O.OO.O.O....OO..O.O..O...OO .....O.OO.O.O...OO....O......O.O..O.O.OO.. .....O..O...O.....O....OO..O..OOO.......O. .....OO......O.OO..OO.........O........... ...........OOO...........OO............... .....OO................................... .....O.................................... .....O.................................... ...OOO.O.................................. ..OOO..................................... .......................................... ..O.OOO................................... .O..O..................................... ..O.O..................................... ...O..OO.................................. ......OO.................................. .....OO................................... ....O.O................................... ...O...................................... ....O.O................................... .....OO................................... ......OO.................................. ...O..OO.................................. ..O.O..................................... .O..O..................................... ..O.OOO................................... .......................................... ..OOO..................................... ...OOO.O.................................. .....O.................................... .....O.................................... .....OO................................... ...........OOO...........OO............... .....OO......O.OO..OO.........O........... .....O..O...O.....O....OO..O..OOO.......O. .....O.OO.O.O...OO....O......O.O..O.O.OO.. ......OOO..O...O.OO.O.O....OO..O.O..O...OO ......OO....O.....OO...O...OOO..OOO....... ........O....OO.O...............O......... ......OO.................................. .......O.O................................ ........O................................. That ends the summary of new results for period 3 c/3 spaceships. Now I will go on to period 4 spaceship results. Firstly, I will give the new results for the slow period 4 spaceships which travel at c/4. In September 1992 Hartmut Holzwart found a c/4 spaceship with a new type of front end. This is shown below. [Spaceship with required tagalong (speed c/4)] .O..OO............O.....OO.............. O..O....O.....O..O.O....OO.............. .O.....OO....O.OOO...O..OO..OO.......... ..OO....O.O....O......OO...OO.OO.O...... ..O........OO...O.O.....O..OOOOO........ .OO.O....O.......O...OOOO..O..OOOOOO.... ..O.O........O...O......O..OO....O.O..OO ...O.O....OOOOOO.OO..................O.. ........................................ ...O.O....OOOOOO.OO..................O.. ..O.O........O...O......O..OO....O.O..OO .OO.O....O.......O...OOOO..O..OOOOOO.... ..O........OO...O.O.....O..OOOOO........ ..OO....O.O....O......OO...OO.OO.O...... .O.....OO....O.OOO...O..OO..OO.......... O..O....O.....O..O.O....OO.............. .O..OO............O.....OO.............. The last 20 columns of this spaceship are very similar to a tagalong that appeared in a previously known spaceship. The difference in the tagalongs is in the spacing between the halves, and the position of the cells in the last 3 columns. In the spaceship shown here, this isn't a tagalong since the spaceship requires the tagalong to survive. The last 3 columns of the tagalong shown above can be reversed and the tagalong will still work. This same rearrangement works on several other tagalongs that have the same end. The rearrangement is shown below. [Possible rearrangement of last few columns of above spaceship] O.O...... O.....O.. OOOOO..OO ..O.O.... ......... ......... ......... ..O.O.... OOOOO..OO O.....O.. O.O...... Hartmut later found a second known tagalong that also can be used to support the new front end. This is shown below. [Spaceship with alternative required tagalong (speed c/4)] .O..OO............O............O. O..O....O.....O..O.O...OO..O.OOOO .O.....OO....O.OOO....O..OO.....O ..OO....O.O....O......O.OO......O ..O........OO...O.O..........OOOO .OO.O....O.......O....OO.O.....O. ..O.O........O...O...OO.......... ...O.O....OOOOOO.OO....OOOO...... ................................. ...O.O....OOOOOO.OO....OOOO...... ..O.O........O...O...OO.......... .OO.O....O.......O....OO.O.....O. ..O........OO...O.O..........OOOO ..OO....O.O....O......O.OO......O .O.....OO....O.OOO....O..OO.....O O..O....O.....O..O.O...OO..O.OOOO .O..OO............O............O. Hartmut also found some new tagalongs for previously known c/4 front ends. Several of these are shown below. [Several different front ends for old period 4 spaceship (speed c/4)] ...........O......................O................ .........O..OO...OO.....OO.......OOOO..........OOO. .......OOO......OOOO...O........OO.O............... .O..O...O.......O...O.OO...O.O.........OO...OO..OO. .O..O.O.OO......OOOO..OO...OO...O.....OO.O.O.OOOO.. OO........O.OO..O..O...O.....O.............O.O..... .O.OO.OOOO.OO.O..OO.....OO....OO......OO....OOO..O. .O..........OO........................O....O.OO.O.O .O.OO.OOOO.OO.O..OO.....OO....OO......OO....OOO..O. OO........O.OO..O..O...O.....O.............O.O..... .O..O.O.OO......OOOO..OO...OO...O.....OO.O.O.OOOO.. .O..O...O.......O...O.OO...O.O.........OO...OO..OO. .......OOO......OOOO...O........OO.O............... .........O..OO...OO.....OO.......OOOO..........OOO. ...........O......................O................ .........O..OO...OO.....OO.......OOOO..........OOO. .......OOO......OOOO...O........OO.O............... .O..O...O.......O...O.OO...O.O.........OO...OO..OO. .O..O.O.OO......OOOO..OO...OO...O.....OO.O.O.OOOO.. OO........O.OO..O..O...O.....O.............O.O..... .O.OO.OOOO.OO.O..OO.....OO....OO......OO....OOO..O. .O..........OO........................O....O.OO.O.O .O.OO.OOOO.OO.O..OO.....OO....OO......OO....OOO..O. OO........O.OO..O..O...O.....O.............O.O..... .O..O.O.OO......OOOO..OO...OO...O.....OO.O.O.OOOO.. .O..O...O.......O...O.OO...O.O.........OO...OO..OO. .......OOO......OOOO...O........OO.O............... .........O..OO...OO.....OO.......OOOO..........OOO. ...........O......................O................ ...........O.............................O............ .........O..OO...OO.....OO..........OO..O.O........... .......OOO......OOOO...O.......O.O.OOOO.OOOO.......... .O..O...O.......O...O.OO...O.OOO....OO.OO..OOO....O.O. .O..O.O.OO......OOOO..OO...OO.O.......O........O.OO..O OO........O.OO..O..O...O.....O..........O.....OOO....O .O.OO.OOOO.OO.O..OO.....OO............OO......OO...... .O..........OO.......................O................ .O.OO.OOOO.OO.O..OO.....OO............OO......OO...... OO........O.OO..O..O...O.....O..........O.....OOO....O .O..O.O.OO......OOOO..OO...OO.O.......O........O.OO..O .O..O...O.......O...O.OO...O.OOO....OO.OO..OOO....O.O. .......OOO......OOOO...O.......O.O.OOOO.OOOO.......... .........O..OO...OO.....OO..........OO..O.O........... ...........O.............................O............ ...........O.............................O........ .........O..OO...OO.....OO..........OO..O.O....... .......OOO......OOOO...O.......O.O.OOOO.OOOO...... .O..O...O.......O...O.OO...O.OOO....OO.OO..OOO.... .O..O.O.OO......OOOO..OO...OO.O.......O........OOO OO........O.OO..O..O...O.....O..........O.....OO.O .O.OO.OOOO.OO.O..OO.....OO............OO......OOO. .O..........OO.......................O............ .O.OO.OOOO.OO.O..OO.....OO............OO......OOO. OO........O.OO..O..O...O.....O..........O.....OO.O .O..O.O.OO......OOOO..OO...OO.O.......O........OOO .O..O...O.......O...O.OO...O.OOO....OO.OO..OOO.... .......OOO......OOOO...O.......O.O.OOOO.OOOO...... .........O..OO...OO.....OO..........OO..O.O....... ...........O.............................O........ The last 16 columns of this spaceship are the same as the back of a spaceship that was shown near the end of article 4. But here the back end connects to the rest of the spaceship in a different way. ...........O..............................O............ .........O..OO...OO.....OO..........OO..OO............. .......OOO......OOOO...O.......O.O.OOOOO..O............ .O..O...O.......O...O.OO...O.OOO....OOOOO.O..OOO.O.O... .O..O.O.OO......OOOO..OO...OO.O.........O.OO..OOOO...O. OO........O.OO..O..O...O.....O...........OO...........O .O.OO.OOOO.OO.O..OO.....OO................OOOOOOOOOOO.O .O..........OO......................................... .O.OO.OOOO.OO.O..OO.....OO................OOOOOOOOOOO.O OO........O.OO..O..O...O.....O...........OO...........O .O..O.O.OO......OOOO..OO...OO.O.........O.OO..OOOO...O. .O..O...O.......O...O.OO...O.OOO....OOOOO.O..OOO.O.O... .......OOO......OOOO...O.......O.O.OOOOO..O............ .........O..OO...OO.....OO..........OO..OO............. ...........O..............................O............ All of the base slow spaceships shown so far have had odd symmetry. In October 1992, Hartmut Holzwart found the first base c/4 spaceship that had even symmetry. This is shown below. [First slow period 4 spaceship with even symmetry (speed c/4)] ............................ ..........O...OO.OO......... ........OOO........O........ ..O...OO.O..O.OO............ OO...OOO..OOOO..O...O..OOO.. ..O...OOO...O...O...OOO...OO ..........OO....OOO...O...OO ......OO.OO....O.....OO.O... ......OO.OO....O.....OO.O... ..........OO....OOO...O...OO ..O...OOO...O...O...OOO...OO OO...OOO..OOOO..O...O..OOO.. ..O...OO.O..O.OO............ ........OOO........O........ ..........O...OO.OO......... Hartmut has found several other c/4 spaceships with even symmetry. They show a range of separations between the front pair of traffic lights predecessors. These spaceships are shown below. [Other slow period 4 spaceships with even symmetry (speed c/4)] ..................O.... ..O.OO.........OO..O... OO...O.........OO.O.... ..O.O..........OOOO.... ......OOO..OOOOO....... ......OO..O.O.O.O...OO. ........OOOOO.O.O...O.O .........OO...OOOO..O.O ..........O.O.O.OOO.O.. ..........O.O.O.OOO.O.. .........OO...OOOO..O.O ........OOOOO.O.O...O.O ......OO..O.O.O.O...OO. ......OOO..OOOOO....... ..O.O..........OOOO.... OO...O.........OO.O.... ..O.OO.........OO..O... ..................O.... ...........O......OO... ...........OO.OO..OOO.O ...........O....O...O.O ..............OO..OOO.O ..O...OOO.........OO... OO...OOO..O.O.......... ..O...OOOOOO.O......... .............O......... ......OO............... ......OO............... .............O......... ..O...OOOOOO.O......... OO...OOO..O.O.......... ..O...OOO.........OO... ..............OO..OOO.O ...........O....O...O.O ...........OO.OO..OOO.O ...........O......OO... ..........O................. ........OO.................. .....O.O.O.O.........OOO..OO ..O..O....O....O...OO.OOOO.. OO...OO....O...O...O.....O.O ..O..OO.......O.OO.OOOOO.OO. ....O..O....OOO.OO.......O.. .....OO......OO.O...OO.O.... ....................OO..OO.. ....................OO..OO.. .....OO......OO.O...OO.O.... ....O..O....OOO.OO.......O.. ..O..OO.......O.OO.OOOOO.OO. OO...OO....O...O...O.....O.O ..O..O....O....O...OO.OOOO.. .....O.O.O.O.........OOO..OO ........OO.................. ..........O................. Hartmut found very few tagalongs for these even symmetrical spaceships. Tagalongs are only known for the last spaceship shown above. The two known tagalongs are shown below. [Two tagalongs for slow period 4 spaceship with even symmetry (speed c/4)] ..........O.............................. ........OO............................... .....O.O.O.O.........OOO..OO...........O. ..O..O....O....O...OO.OOOO.......OO..OO.. OO...OO....O...O...O.....O.O..O.OO.O.O.O. ..O..OO.......O.OO.OOOOO.OO..OO.OOOO.O.O. ....O..O....OOO.OO.......O.........OO...O .....OO......OO.O...OO.O.............O..O ....................OO..OO............... ....................OO..OO............... .....OO......OO.O...OO.O.............O..O ....O..O....OOO.OO.......O.........OO...O ..O..OO.......O.OO.OOOOO.OO..OO.OOOO.O.O. OO...OO....O...O...O.....O.O..O.OO.O.O.O. ..O..O....O....O...OO.OOOO.......OO..OO.. .....O.O.O.O.........OOO..OO...........O. ........OO............................... ..........O.............................. ..........O................................ ........OO................................. .....O.O.O.O.........OOO..OO............... ..O..O....O....O...OO.OOOO..........O...... OO...OO....O...O...O.....O.O.......OO....OO ..O..OO.......O.OO.OOOOO.OO......O...O.OOOO ....O..O....OOO.OO.......O...O..O......O... .....OO......OO.O...OO.O......O..O.O...O... ....................OO..OO..O..O........... ....................OO..OO..O..O........... .....OO......OO.O...OO.O......O..O.O...O... ....O..O....OOO.OO.......O...O..O......O... ..O..OO.......O.OO.OOOOO.OO......O...O.OOOO OO...OO....O...O...O.....O.O.......OO....OO ..O..O....O....O...OO.OOOO..........O...... .....O.O.O.O.........OOO..OO............... ........OO................................. ..........O................................ No wide and short c/4 spaceships have been found yet, nor has a base c/4 spaceship which is non-symmetrical been found yet. Near the end of October 1992, the first example of a new type of Life object was found by Hartmut Holzwart and Dean Hickerson. This new type of object is now called a "wickstretcher", for reasons that will become obvious. The first wickstretcher found is shown below. At the left is a period 4 c/4 spaceship component that was found by Hartmut Holzwart. As it moves leftwards it leaves behind a thin wick which has period 5 (but which appears to move at the speed of light). Without a terminating component at the back of the wick, the wick decays at the speed of light and ends up destroying the spaceship component. No moving termination component is known for the wick to finish making a c/4 spaceship. But Dean Hickerson found a period 5 stationary termination component for the wick which stabilizes it, which is seen at the right. In the generation shown here, the wick itself is almost nonexistent, but quickly becomes apparent as the object is run. [First example of a "wickstretcher" known] ...................................OO..........OO........ ...................O................O...OO.O..O.O........ .............O.OO.OO...............O...O.O.OOOO.O.OO..... .............O...O.OO..........O...OO..O.O......O..O..... ..O...OOO....OOOOO.O.O.O......O.O....O.O..OOOOOO.O....... OO...OOO..O.OO.....O.O.O.......O.....O.O.......O.OO...... ..O...OOOOOO..........O.....O.....OO.O...O..OO.....O.OO.O .................O......O.......O..O.OO..O..O.O..OOO.O.OO ......OO.......OO......O.OO.OOO.......O.......O.....O.... ......OO.......OO......O.OO...OOOO.O..O.O.O...O.O.OO..... .................O......O...OO.....O.OO.OO.O...OO.O...... ..O...OOOOOO..........O......O..OO.O...O...O........O.... OO...OOO..O.OO.....O.O.O...O....OO.OOO.O...OO......OO.... ..O...OOO....OOOOO.O.O.O...OO.........O.................. .............O...O.OO................O................... .............O.OO.OO.................OO.................. ...................O..................................... A month later Dean Hickerson found a smaller version of the termination component, which is shown below. Like the previous terminator, this one is unsymmetrical. (Dean had looked for symmetrical terminators, but none were found.) [Smallest version of "wickstretcher"] .................OO.............................. .............OO....O............................. ............OOO.O................................ O.OO..OO...O...OOOO.O.O....OO.......OO........... O....OO..O........O.OOO....O....OO.O..O.OO.O..... O.OO....OO.OO....O...........O...O.O.OO.O.OO..... ......O.......O.............OO.....O..O.O...OO... .....O.........O.O....OOO...O....O..O.O.OOO...O.. .....O.........O.O....OOO.OO.O..OO.O.O...O..OO.O. ......O.......O.............OO.O...OO....OO....O. O.OO....OO.OO....O..........O........OO.O.O.OO.OO O....OO..O........O.OOO........O...O...OO.O..O.O. O.OO..OO...O...OOOO.O.O.......O.O...OO....O..O.O. ............OOO.O..............O.....O.OOO....O.. .............OO....O.................O.O......... .................OO...................O.......... These two wickstretchers are the only known use of the orthogonal non- standard speed spaceships to create objects which grow arbitrarily large. The search for true puffers for non-standard speed spaceships is still unsuccessful. From cellular-automata-request@Think.COM Tue Mar 2 08:27:54 1993 Received: by mail.think.com; Tue, 2 Mar 93 08:27:57 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 2 Mar 93 08:27:54 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 2 Mar 93 08:27:42 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA16379; Tue, 2 Mar 93 08:13:06 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Tue, 02 Mar 1993 04:58:49 GMT From: dbell@pdact.pd.necisa.oz.au (David I. Bell) Organization: NEC Information Systems Australia, Canberra Subject: Spaceships in Conway's Life (Addendum 1c) Message-Id: <1993Mar02.045849.24456@pdact.pd.necisa.oz.au> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM As this article was being prepared, Hartmut Holzwart found another reasonably small slow period 4 spaceship. This is shown below. The front end of this spaceship is the same as in some previous spaceships shown in article 4, but the back end is much smaller. [Newest slow period 4 spaceship (speed c/4)] .......O.................. .....OO................... .......O...OO.....OO...... .....OOO...OO....O.....O.. ....OO..........OO.OOO..OO ..O....O...O.O.O.OOO.O.... OO....O..O.O.OO.OO........ ..O..OOO.................. .......................... ..O..OOO.................. OO....O..O.O.OO.OO........ ..O....O...O.O.O.OOO.O.... ....OO..........OO.OOO..OO .....OOO...OO....O.....O.. .......O...OO.....OO...... .....OO................... .......O.................. That ends the discussion of the new results for slow period 4 spaceships. Now I will go on to the new results for the period 4 spaceships which move at the standard speed of c/2. Most of these new spaceships are tagalongs of a convoy of standard spaceships, or almost-spaceships. Hartmut found some new tagalongs for pairs of almost-spaceships with several different separations, all of which are symmetrical. The spaceships below have a separation of one cell between the almost-spaceships. [Two period 4 spaceships (speed c/2)] ....................O.O...... ...........OO.....OO....O.... ..........OOOO....OO.....OO.. .O.......O.O.OO.O....OOO.OOOO O.....O.OO.....O..OOO.OO..... O.....OOO....O......OO.O.O.O. OOOOO.O.O..OO....O....OO..... ........O.O.O...O......O.O... ........O.O.................. ........O.O.O...O......O.O... OOOOO.O.O..OO....O....OO..... O.....OOO....O......OO.O.O.O. O.....O.OO.....O..OOO.OO..... .O.......O.O.OO.O....OOO.OOOO ..........OOOO....OO.....OO.. ...........OO.....OO....O.... ....................O.O...... .....................O..O.O.O.......... .....................O....O.O.......... ..............OO.OO..O.....O........... .O........OOO...OO.O..O...O.......OOOO. O.....O..OO...........O...O.......O...O O.....OOO.O.O..O.......OO.O......O..... OOOOO.O.O.O.O..O..........OO..O.OOOO..O ........O.O...O............OOOO.OO..... ........O.O............................ ........O.O...O............OOOO.OO..... OOOOO.O.O.O.O..O..........OO..O.OOOO..O O.....OOO.O.O..O.......OO.O......O..... O.....O..OO...........O...O.......O...O .O........OOO...OO.O..O...O.......OOOO. ..............OO.OO..O.....O........... .....................O....O.O.......... .....................O..O.O.O.......... In the above spaceship, the last seven columns are actually a tagalong and can be removed. The tagalong is made of two standard spaceships pushing ahead little bits of "dirt". The following is a tagalong to four standard spaceships. The separation of one cell for the front two spaceships is the same as that used for the Schick engine. [Four standard spaceships with period 4 tagalong (speed c/2)] ..........OOOO.... .........OOOOOO... ........OO.OOOO... .........OO....... .................. ..............O... ............O..... OOOO.......O...O.. O...O.....OO....O. O.......O..O...... .O..O..OOO.O..O... ......OO..OO..O..O .O..O..OOO.O..O... O.......O..O...... O...O.....OO....O. OOOO.......O...O.. ............O..... ..............O... .................. .........OO....... ........OO.OOOO... .........OOOOOO... ..........OOOO.... For a separation of seven cells, Hartmut Holzwart found that two LWSSs can support a particularly small tagalong. This one could possibly have been found manually. [Small period 4 tagalong for two LWSSs (speed c/2)] OOOO..... O...O.... O........ .O..O.... ......... .....OOOO ....O..O. ....O..O. ....O..O. .....OOOO ......... .O..O.... O........ O...O.... OOOO..... The same two LWSSs also can support a larger tagalong, as shown below. This tagalong has a nice set of sparks at the back. [Two LWSSs supporting a larger tagalong (speed c/2)] OOOO.............. O...O.......OOO... O.......OOO..OOO.. .O..O..OOOO..OOO.. ......OOO.....OO.. ....OO....OO..OOO. ...O.OO.O.OO..O.OO ..O......O..O.O.O. ..O..O.....O..O.OO ..O......O..O.O.O. ...O.OO.O.OO..O.OO ....OO....OO..OOO. ......OOO.....OO.. .O..O..OOOO..OOO.. O.......OOO..OOO.. O...O.......OOO... OOOO.............. The sparks from the above tagalong can support a number of other tagalongs. Some of these are shown below. In the phases shown here, some of the connections appear very tenuous. [Various tagalongs to a tagalong of two LWSSs (speed c/2)] OOOO.................. O...O.......OOO....... O.......OOO..OOO...... .O..O..OOOO..OOO...... ......OOO.....OO...... ....OO....OO..OOO..... ...O.OO.O.OO..O.OO.... ..O......O..O.O.O..O.O ..O..O.....O..O.OO.... ..O......O..O.O.O..O.O ...O.OO.O.OO..O.OO.... ....OO....OO..OOO..... ......OOO.....OO...... .O..O..OOOO..OOO...... O.......OOO..OOO...... O...O.......OOO....... OOOO.................. ...................O.O...................O.O... OOOO..............O.....................O..O.O. O...O.......OOO...O..O....OOO..........OO.....O O.......OOO..OOO..OOO.OO.O.OO.OO......O....O..O .O..O..OOOO..OOO......OO.O.O.OO...OO.OOOOO.O.O. ......OOO.....OO.....O...O.O................... ....OO....OO..OOO.....OO.OOOOOOOOO...OOO.OOO..O ...O.OO.O.OO..O.OO.....OO................OOO..O ..O......O..O.O.O........OOOOOOOOOOOO..O....... ..O..O.....O..O.OO.....................OO...... ..O......O..O.O.O........OOOOOOOOOOOO..O....... ...O.OO.O.OO..O.OO.....OO................OOO..O ....OO....OO..OOO.....OO.OOOOOOOOO...OOO.OOO..O ......OOO.....OO.....O...O.O................... .O..O..OOOO..OOO......OO.O.O.OO...OO.OOOOO.O.O. O.......OOO..OOO..OOO.OO.O.OO.OO......O....O..O O...O.......OOO...O..O....OOO..........OO.....O OOOO..............O.....................O..O.O. ...................O.O...................O.O... In the following spaceship, the final tagalong is supported by a set of two close sparks from the first tagalong. Those sparks could be provided by two LWSSs instead, but that turns out not to work because the sparks from the LWSSs two generations later destroy the MWSSs. So you need this large spaceship (or ones with similar sparks) in order to support the last tagalong. [Period 4 spaceship with simple tagalong to a tagalong (speed c/2)] OOOO................OO.... O...O.......OOO....OO.OOO. O.......OOO..OOO....OOOOO. .O..O..OOOO..OOO.....OOO.. ......OOO.....OO.......... ....OO....OO..OOO......... ...O.OO.O.OO..O.OO...OO.OO ..O......O..O.O.O....O.... ..O..O.....O..O.OO...O.... ..O......O..O.O.O....O.... ...O.OO.O.OO..O.OO...OO.OO ....OO....OO..OOO......... ......OOO.....OO.......... .O..O..OOOO..OOO.....OOO.. O.......OOO..OOO....OOOOO. O...O.......OOO....OO.OOO. OOOO................OO.... In the following two tagalongs in the series, the only difference is in the last few columns. In the first spaceship, the tail is actually of period 2. But in the second spaceship, the last few columns revert back to period 4. [Two period 4 spaceships with interesting tagalongs (speed c/2)] ...................O.O.......O.O............ OOOO..............O.........O.OO............ O...O.......OOO...O..O....O..............O.O O.......OOO..OOO..OOO.OO.O.O.O..........O..O .O..O..OOOO..OOO......OO.O.O.OO........OO... ......OOO.....OO.....O...O.O.OO..OOO..O...O. ....OO....OO..OOO.....OO.O...OO.O....OOO.O.. ...O.OO.O.OO..O.OO.....OO.....O.O...O....... ..O......O..O.O.O........OOOOO...OOOOOOOOO.. ..O..O.....O..O.OO.......................... ..O......O..O.O.O........OOOOO...OOOOOOOOO.. ...O.OO.O.OO..O.OO.....OO.....O.O...O....... ....OO....OO..OOO.....OO.O...OO.O....OOO.O.. ......OOO.....OO.....O...O.O.OO..OOO..O...O. .O..O..OOOO..OOO......OO.O.O.OO........OO... O.......OOO..OOO..OOO.OO.O.O.O..........O..O O...O.......OOO...O..O....O..............O.O OOOO..............O.........O.OO............ ...................O.O.......O.O............ ...................O.O.......O.O...........O.O.. OOOO..............O.........O.OO..........O..O.. O...O.......OOO...O..O....O..............OO..... O.......OOO..OOO..OOO.OO.O.O.O..........O...O... .O..O..OOOO..OOO......OO.O.O.OO........OOO.O.... ......OOO.....OO.....O...O.O.OO..OOO..O......... ....OO....OO..OOO.....OO.O...OO.O....OOOOOOO.... ...O.OO.O.OO..O.OO.....OO.....O.O...O........O.O ..O......O..O.O.O........OOOOO...OOOOOOOOOOOOOOO ..O..O.....O..O.OO.............................. ..O......O..O.O.O........OOOOO...OOOOOOOOOOOOOOO ...O.OO.O.OO..O.OO.....OO.....O.O...O........O.O ....OO....OO..OOO.....OO.O...OO.O....OOOOOOO.... ......OOO.....OO.....O...O.O.OO..OOO..O......... .O..O..OOOO..OOO......OO.O.O.OO........OOO.O.... O.......OOO..OOO..OOO.OO.O.O.O..........O...O... O...O.......OOO...O..O....O..............OO..... OOOO..............O.........O.OO..........O..O.. ...................O.O.......O.O...........O.O.. Hartmut Holzwart found another series of spaceships which are tagalongs to four standard spaceships, and which are no longer symmetrical, but which are glide-reflective. Some of these are shown below. [Four LWSSs with various large tagalongs (speed c/2)] ........O..O..................................... .......O......................................... .O..O..O...O...........................O......... O......OOOO.......................O...O....O.O... O...O...............O....OO.O..OOOOO.OO..OO...OO. OOOO..........O..OOOOO.OO.....OO.....OOOO....O... .......O..O...O.OO......OOO..O.O..OOO..O....O.... ......OO.OO.OO...OOOO.O.OO.OO..O..O.OOO.....O.... .....O.O.O........OOO.O..OOO...OO......O...OO.... .....O...OO.OOO...........OOO..OO........O.O.OO.O .....OO.OO....OOO........OO.O..OO......OO.....OO. .....OO.O.O.OO.OO...OO.........OO.O..O.....O...O. ............OOO..OO...O.O....O..O..OOO..O.....O.. .O..O..OO...OO.O...O...O...O..O.OO.OO.OO.OO...... O..............O...O....OOO.O.O.........O..OO.... O...O...O..O.....O.O..OO.O.....OOO...OOO...OOO..O OOOO...O.........................O....OOOO.OO..O. .......O...O...........................O......... .......OOOO...................................... ........O..O.................................. .......O........................O.OO....OO.OO. .O..O..O...O.................OOOO.OO....OO.... O......OOOO.......OO........OO...O..OOOOO..OO. O...O...........OOOO.......OOO..O...O..O...... OOOO..........O.O...O..OOO..O..OO...O...O..... .......O..O...O......O.O.OO.............O..... ......OO.OO.OO.....O.OOO.O.OO........OO.O....O .....O.O.O.........O.OO...............OOOO.O.O .....O...OO.OOO..OOO.O.O.O...............O.... .....OO.OO....OOO..OO..O.O............OOO..... .....OO.O.O.OO.OO......O.O.O..........OO..OO.. ............OOO.O..........OO........O..OO.OO. .O..O..OO...OO.OO...OOO.O..OOOO.......O..OO... O..............O.OO.OO.OOO..OOO...O..O..OOO... O...O...O..O....OOOO.OO.OO.OO.OO....OO.OOO.... OOOO...O....................O......O...O...... .......O...O.................OOO.O.....OOO.O.. .......OOOO....................O.OO.......O... ..........................................O... In the last spaceship of this series, the tagalong breaks apart into two components which do not react with each other. Each one of these components becomes symmetrical, which is unusual. [Four LWSSs with tagalong which splits and becomes symmetrical (speed c/2)] ........O..O................................... .......O................OO.........OO.OO...OO.. .O..O..O...O..........O........OOO.OOO..O..O..O O......OOOO.........OOO...O..O..O..O.....O....O O...O...........O...O.O....OOOO.OO....O..O.O... OOOO..........O.OOOO....OO.O.O..O..O.....O....O .......O..O...O.........OO.....OOO.OOO..O..O..O ......OO.OO.OO....O.O.....O........OO.OO...OO.. .....O.O.O.......O....OOO...................... .....O...OO.OOO..O..O.O........................ .....OO.OO....OOO.............................. .....OO.O.O.OO.O..OO..OOO...................... ............OOO.O..O....O.......OO.O..O..O.O..O .O..O..OO...OO.OOOOO....OOO.....OOO.O.O....O..O O..............O...OO..O..O..O.O.....OO.....OO. O...O...O..O....OO.O.O....O.O.OO..OOO...O..O... OOOO...O............O........O.O.....OO.....OO. .......O...O..........OOOO......OOO.O.O....O..O .......OOOO.....................OO.O..O..O.O..O Here is another spaceship in a series started in article 5, where a known front end connects to several large components. Like those other spaceships, this spaceship is glide-reflective. [Period 4 spaceship with large components (speed c/2)] ...................................................................O.O ..OOO.................................................OO..........OO.O .OOOO....................O..O........................OO.OO.O.....O.... OO.....................OOO..O............O..O.........O.OO.....OO.OO.. .O.OO.................O.....O.......O....O...O......O.O....O.O.O.O.... ..OO.OO.O...OOO.....OO.OOO.O.......OO....O.........OO.O.OO..O.O.OO.... ......O..OO.OO.O...O.O..OO.O......OOOOOOO.O.O......O.O.O..OO..OO...... ....OOO.OO...OO..O...OO....O.........OO.O.O.O..OOO.O.O.O..O..O.O...... ....OOO.....O...O.O...O.OO...OO..O........O.O...OO.O.O.O...O.OO....... ......O.OO.O.O...............O.OO..O.OOO.O.O....O.O.O.O....O..OO...... ....OO.......OOO..OO.O..O......OO.OOO...OO.O.OO..O..O.O.OO....OO...... ...OO.OOO.....O...O.O....O....O...OO.....O.O.....O..O.O....O.OO....... ..O...OO....OOOO.....OO..OO...O....O....O...O......OO..O.OO........... .OO.O.O......OO......OO.............O...OO.O........OO.O...O.O.O...... OO..O.O................OOOO...O...........O..........O.OOO...O.OOOO... .OO.......................OO.O........................O....O....OOO... ....OO................................................OOOOO..........O .......................................................OO..........OO. Finally, Hartmut Holzwart found another small symmetrical period 4 spaceship. This produces sparks on the outside edge like a HWSS. [Small period 4 symmetrical spaceship (speed c/2)] ..OO.OOOOOO. .OOOO......O OO.......... .O.........O ..OOO.O..... ....O....... ....O....... .....O...... ....O....... ....O....... ..OOO.O..... .O.........O OO.......... .OOOO......O ..OO.OOOOOO. The length of the tails in the above spaceship cannot be shortened to produce the MWSS or LWSS style of sparks. But the tails can be lengthened if they are supported by standard spaceships. This is shown below. [Longer period 4 spaceship supported by two standard spaceships (speed c/2)] ......OO...... .....OO.OOO... ......OOOOO... .......OOO.... .............. .............. .............. ..OO.OOOOOOO.. .OOOO.......O. OO............ .O..........O. ..OOO.O...O... ....O......... ....O......... .....O........ ....O......... ....O......... ..OOO.O...OO.. .O...........O OO............ .OOOO........O ..OO.OOOOOOOO. .............. .............. .............. .......OOOO... ......OOOOOO.. .....OO.OOOO.. ......OO...... That ends the discussion of new period 4 spaceships. Now I will go on to the single new result for period 5 spaceships. On December 5, 1992, Hartmut Holzwart found a period 5 spaceship which travels at 2c/5. This is only the second such base spaceship known. Unlike the first spaceship which was found by Dean Hickerson, this one has even symmetry. [Second known period 5 spaceship (speed 2c/5)] ...O............ .O.O....O....... OO.OOO...O....O. .OO.O........O.O ......OO...OOO.. .....O...O...... ......OO....OOOO ......OO.OOOO.OO ................ ................ ......OO.OOOO.OO ......OO....OOOO .....O...O...... ......OO...OOO.. .OO.O........O.O OO.OOO...O....O. .O.O....O....... ...O............ No period 5 spaceship has been found which travels at c/5. That ends the discussion on period 5 spaceships. Now I will move on to the period 96 c/12 Cordership. In article 1 of my series, I showed Dean Hickerson's Cordership which travels diagonally at c/12. I neglected to give a few useful pieces of information about it. Firstly, the back four switch engines can be moved backwards by any multiple of eight cells, if extra blocks are also inserted on the sides to continue the obvious pattern. This is because the only use of the back four switch engines is to delete the blocks left by the other switch engines. So this allows an arbitrarily large spaceship to be constructed which moves diagonally at c/12. And where there is room, the phase of the back switch engines can be adjusted with respect to the other switch engines. Secondly, the Cordership will still work if the back four switch engines are moved backwards by one or two cells. (In fact, any combination of the four back switch engines can be moved backwards by two cells.) Thirdly, a Cordership can be made larger by inserting more switch engines into each row of switch engines. This lets you make a Cordership which is as wide as you want. Lastly, if one switch engine is moved one cell backwards with respect to an adjacent one, then a block will be produced behind the two switch engines. By adjusting the positions of the back switch engines, from 1 to 3 blocks can be produced. These blocks can be used to support other rows of switch engines to produce very large compound Corderships. Below is a compound Cordership which illustrates an extra row of switch engines connecting two Corderships which each leave behind single blocks. Since this is a large object, the picture has been compressed. Each dollar sign represents ten periods. Simply use an editor to replace each dollar sign by ten periods to reconstruct the full picture. [Two period 96 Corderships connected by switch engines (speed c/12)] $$$.....OO$$$$$$$$$$$$$... $$$.....O...OO$$$$$$$$$$$$......... $$$....O......O.......OOO$$$$$$$$$$$........ $$$..OOOOO...O.....OOO$$$$$$$$$$$$. $$$.....O...O......OOO$$$$$$$$$$$$. $$$..O..O$.O$$$$$$$$$$$$.. $$....OO.......OO$$$$$$$$$$$$$..... $$....OO$$$$$$$$$$$$$$.... $$$$$$$$$$$$$$$$$ $$$$$........O$$$$$$$$$$$. $$$$$........O$$$$$$$$$$$. $$$$$........O$$$$$$$$$$$. $$$$$......OO$$$$$$$$$$$.. $$$$$.....OOO$$$$$$$$$$$.. $......OO$$$........OO$$$$$$$$$$$.. $......OO$$$$$$$$$$$$$$$.. $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$........O$$$$$$$$$$$. $$$$$.......O$$$$$$$$$$$.. $$$$$........O$$$$$$$$$$$. ........OO$$$$$$$$$$$$$$$$ ........OO$$$......O$$$$$$$$$$$$... $$$$.....O.O$$$$$$$$$$$$.. $$$$....OO.OO$$$$$$$$$$$$. $$$$.......OO$$$$$$$$$$$$. $$$$.OO$$$$$$$$$$$$....... $$$$...O..OOO$......O.O.......OOO$$$$$$$$$.. $$$$.OO.O$$.O.....OOO$$$$$$$$$..... OO$$$$.O..O$$.....OOO$$$$$$$$$..... OO$$$$.O$$.........O$$$$$$$$$...... ....O.......O$$$.OO$$$$$$$$$$$$.... ...O.O.....OOO$$$$$$$$$$$$$$$...... ..O..O..OOOO.OO$$$O$$$$$$$$$$$$.... ........O..OOO$$.........OO.OO$$$......O$$$$$$$$..... .....O..OO..O$$$.O$$$.........O$$$$$$$$..... ...O.O.OO$$$........O$$$......O$$$$$$$$..... ....O$$$$O$..O.OO$$OO$$$$$$$$...... $$$$.........O.O......O.OOO$........OOO$$$$$$$$...... $$$$$.O....O.O....O$........OO$$$$$$$$...... $$$$........O...O.O......OO$$$$$$$$$$....... $$$$$OO..O..O...O$$$$$$$$$$........ $$$$$.O...OO.O$$$$$$$$$$$. $$$$$.......O.O$$$$$$$$$$$ $$$$$.......O.O$$....O$$$$$$$$..... $$......O$$$$$......O.O$$$$$$$$.... $$.....OOO$$$$$....O..O$$$$$$$$.... $$....OO.OO$$$$$$$$$$$$$$. $$.....OOO$$$$$$$$$$$$$$.. $$......O$$$$$......O..O$$$$$$$$... $$....O.O$$$$$....OOO.OO$$$$$$$$... $$...OOOO$$$$$...O..OO$$$$$$$$..... $$...O$$$$$......O..O$$$$$$$$...... $$$$$$$$.O.O$$$$$$$$...... $$...OO.OO$$$$$$$$$$$$$$.. $$..O.....O$$$$$$$$$$$$$$. $$...O...O$$$$$$$$$$$$$$.. $$......O...O.......O$$$$$$$$$$$$$. $$.........O.O.....OOO$$$$$$$$$$$$$ $$........O..O..OOOO.OO$$$$$$$$$$$$......... $$$....O..OOO$$$.........OO$$$$$$$$......... $$$.O..OO..O$$$$OO$$$$$$$$......... $$.........O.O.OO$$$$$$$$$$$$$..... $$$O$$$$$$$$$$$$$......... $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$.OO$$$$$$$$$....... $$$$$$$.OO$$$$$$$$$....... $$$$$...O$$$$$$$$$$$...... $$$$$..OOO$$$$$$$$$$$..... $$$$$.OO.OO$$$$$$$$$$$.... $$$.........OO$.OOO$$$$$$$$$$$..... $$$.........OO$..O$$$$$$$$$$$...... $$$$$.O.O$$$$$$$$$$$...... $$$$$OOOO.........OO$$$$$$$$$$..... $$$$$O$..OO$$$$$$$$$$..... $$$$$$$$$$$$$$$$$ $$$$$OO.OO$$$$$$$$$$$..... $$$$.........O.....O$$$$$$$$$$$.... $$$.OO$.......O...O$$$$$$$$$$$..... $$$.OO...O.......O........O$$$$$$....OO$$$$$ $$$.....O.O.....OOO$$$$$$$..O...OO$$$$...... $$$....O..O..OOOO.OO........OO$$$$$$O......O.......OOO$$$..... $$$$O..OOO.........OO$$$$$........OOOOO...O.....OOO$$$........ $$$.......O..OO..O$$$$$$$...O...O......OOO$$$........ $$$.....O.O.OO$$$$$$$....O..O$.O$$$......... $$$......O$$$$$$$OO.......OO$$$$$.. $$$$$$$$$$.......OO$$$$$$. $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$.O$$........ $$$$$$$$$$$$$$.O$$........ $$$$$$$$$$$$$$.O$$........ $$$$$$$$$$$$$.........OO$$......... $$$$$$$$$$$$$........OOO$$......... $$$$$........O$$$$OO$$$........OO$$......... $$$$$.......OOO$$$.........OO$$$$$$......... $$$$$......OO.OO$$$$$$$$$$......... $$$$$.......OOO$$$$$$$$$$$ $$$$$........O$$$$$$$$$$$. $$$$$......O.O$$$$$$$$..O$$........ $$$$$.....OOOO$$$$$$$$.O$$......... $$$$$.....O$$$$$$$$.....O$$........ $$$$$$$$$.OO$$$$$$$....... $$$$$.....OO.OO$$$.OO$$$......O$$$$ $$$$$....O.....O$$$$$$.......O.O$$$......... $$$$$.....O...O$$$$$$.......OO.OO$$$........ $$$$$........O...O.......O$$$$$.........OO$$$........ $$$$$$.O.O.....OOO$$$$$..OO$$$$.... $$$$$$O..O..OOOO.OO$$$$$...O..OOO$......O.O.......OOO......... $$$$$$......O..OOO$$$$$..OO.O$$.O.....OOO$.. $$$$$$...O..OO..O$..OO$$$$.O..O$$.....OOO$.. $$$$$$.O.O.OO$......OO...O.......O$$.........O$$.........O$... $$$$$$..O$$....O.O.....OOO$$.........OO$$$$. $$$$$$$$......O..O..OOOO.OO$$$$$$$. $$$$$$$$$..O..OOO$$$O$$$$. $$$$$$$$.........O..OO..O$$.........OO.OO$$$......O.. $$$$$$$$.......O.O.OO$$$....O$$$.........O.. $$$$$$$$........O$$$$.O$$$......O.. $$$$$$$$$$$$........O$..O.OO$$OO... $$$$$$$$$$$$$..O.O......O.OOO$........OOO... $$$$$$$$....O$$$$.........O....O.O....O$........OO... $$$$$$$$...OOO$$$$.....O...O.O......OO$$.... $$$$$$$$..OO.OO$$$$......OO..O..O...O$$..... $$$$$$$$...OOO$$$$........O...OO.O$$........ $$$$$$$$....O$$$$$.....O.O$$....... $$$$$$$$..O.O$$$$$.....O.O$$....O.. $$$$$$$$.OOOO.........OO$...O$$$$$......O.O. $$$$$$$$.O$..OO$..OOO$$$$$....O..O. $$$$$$$$$$.......OO.OO$$$$$........ $$$$$$$$.OO.OO$$..OOO$$$$$......... $$$$$$$$O.....O$$..O$$$$$......O..O $$$$$$$$.O...O$$.O.O$$$$$....OOO.OO $$$$$$$$....O$$.OOOO$$$$$...O..OO.. $$$$$$$$$$......O$$$$$......O..O... $$$$$$$$......OO$$$$$$$......O.O... $$$$$$$$......OO$........OO.OO$$$$$......... $$$$$$$$$$.....O.....O$$$$$........ $$$$$$$$$$......O...O$$$$$......... $$$$$$$$$$.........O...O.......O$$$$........ $$$$$$$$$$$..O.O.....OOO$$$$....... $$$$$$$$$$$.O..O..OOOO.OO$$$$...... $$$$$$$$$$$.......O..OOO$$$.........OO...... $$$$$$$$$$$....O..OO..O$$$$OO...... $$$$$$$$$$$..O.O.OO$$$$$.. $$$$$$$$$$$...O$$$$$...... $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$....OO$.... $$$$$$$$$$$$$$$....OO$.... $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$.....O$$$.... $$$$$$$$$$$$$....OOO$$$... $$$$$$$$$$$$$...OO.OO$$$.. $$$$$$$$$$$$$....OOO$$$... $$$$$$$$$$$$$.....O$$$.... $$$$$$$$$$$$$...O.O$OO$$.. $$$$$$$$$$$$$..OOOO$OO$$.. $$$$$$$$$$$$$..O$$$....... $$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$..OO.OO$$$... $$$$$$$$$$$$$.O.....O$$$.. $$$$$$$$$$$$$..O...O$$$... $$$$$$$$$$$$$.....O$$$.... $$$$$$$$$$$$$........OO$$$ $$$$$$$$$$$$$........OO$$$ By combining the techniques for modifying Corderships, very large and complicated spaceships can be constructed which travel diagonally at c/12. That ends the discussion of the Cordership. Now I will summarize the new developments for large period spaceships and puffers. The new results found here are by me. Firstly, it is possible to fill in some of the gaps in large period puffers. These gaps are the periods below about 1100, above which the glider-turning methods can produce any period which is a multiple of 4. The pattern below is a puffer with a period of 360. It produces several pairs of blocks, and a small pile of random debris. It is constructed from two period 120 backwards rakes and a blinker puffer. The first pair of gliders from the rakes ignite the blinker fuse, and the rake's period is high enough so that further gliders from the rakes miss the fuse and just form blocks. That is, until the fuse burns out and a new row of blinkers is created to begin the process again. [Period 360 puffer (speed c/2)] .................................OO............................... ..O..O.....OO...................OO.OOO............................ .O........OOOO...................OOOOO............................ .O...O...OO.OO....................OOO............................. .OOOO.....OO...................................................... .........................OO...................................OO.. ........................O....O..............................O....O ........................OO...O.............................O...... .....OO........OO......O.OOO..O............................O.....O ...OO.OO.......OO.....OOO....OO............................OOOOOO. ...O..O..........O.....O.OO.O..................................... ...O..O.........O.......OOO....................................... ....OO...................OO....................................... .................................................................. .................................................................. ..O..O............................................................ .O.........OO...............OO.................O.................. .O...O....OO.OOO...........OO.OO..............OOO................. .OOOO......OOOOO............OOOO...O.....OOO...................... ............OOO..............OO...O.OO...OOO...OO................. .................................O...O........OO.................. .............................OO...O.OO...OOO...................... ............................OOOO...O.....OOO...................... ...........................OO.OO.................................. ............................OO.................................... .................................................................. .................................................................. ....................................................O............. ..................................................O...O........... .................................................O................ .................................................O....O........... .................................................OOOOO............ .................................................................. .................................................................. .................................................................. ..................................................OO.............. .................................................OO.OOO.O......... ..................................................OOOOOOO......... ...................................................OOOOO.......... .................................................................. ......................................................OO.......... ....................................................O....O........ ...................................................O.............. ...................................................O.....O........ ...................................................OOOOOO......... .................................................................. .................................................................. .................................................................. .................................................................. .................................................................. ............................OO.................................... ...........................OO.OO.................................. ............................OOOO...O.....OOO...................... .............................OO...O.OO...OOO...................... .................................O...O........OO.................. ............OOO..............OO...O.OO...OOO...OO................. .OOOO......OOOOO............OOOO...O.....OOO...................... .O...O....OO.OOO...........OO.OO..............OOO................. .O.........OO...............OO.................O.................. ..O..O............................................................ .................................................................. .................................................................. ....OO...................OO....................................... ...O..O.........O.......OOO....................................... ...O..O..........O.....O.OO.O..................................... ...OO.OO.......OO.....OOO....OO............................OOOOOO. .....OO........OO......O.OOO..O............................O.....O ........................OO...O.............................O...... ........................O....O..............................O....O .........................OO...................................OO.. .OOOO.....OO...................................................... .O...O...OO.OO....................OOO............................. .O........OOOO...................OOOOO............................ ..O..O.....OO...................OO.OOO............................ .................................OO............................... The particular pattern above can be squeezed down thinner than is shown, but I left it spread out so that you can easily play with it as described below. By moving the blinker puffer forwards (leftwards) by 12 cells (and adding 6 produced blinkers), a puffer is created with a period which is 480, which is 120 more than the original. This process can be repeated as desired to create a puffer of any period which is 360 + 120 * N. By using other period rakes, some more of the missing puffer periods can probably be constructed in the "large period gap". But this method can obviously only produce puffers which are multiples of the rake's periods. The period has to be large enough so that the second pair of gliders can clear the burning fuse (the period 120 shown here seems just large enough). In article 6 of my series, I described how to construct large period spaceships which use pairs of gliders to ignite a blinker trail. I have since discovered that a single glider will suffice for the ignition, if the collision is perturbed by an accompanying spaceship. So the large period puffers do not have to be symmetrical, they can instead be one-sided. Below is a puffer with period 1340 which illustrates how the one-sided ignition works. Because the puffer is long, it is given in compressed form. Use an editor to replace each dollar sign by ten periods to reconstruct the full picture. $$$.OOOO$$$$$$$$$$$$$$.. $$$.O...O$$$$$$$$$$$$$$. $$$.O$$$$$$$$$$$$$$..... $$$..O..O$$$$$$$$$$$$$$. $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $....O$$$$$$$$$$$$$$$$.. $..O...O$$$$$$$$$$$$$$$$ $.O$$$$$$$$$$$$$$$$..... $.O....O$$$$$$$$$$$$$$$$ $.OOOOO$$$$$$$$$$$$$$$$. $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $O$$$$$$$$$$$$$$$$...... .OO.O...OO.OO$$$$$$$$$$$$$$$$.... O..OOOOO.O$$$$$$$$$$$$$$$$....... O..O.OO.OO$....O$$$$$$$$$$$$$$$.. OO...OOO.OO......OO.O..O.O$$$$$$$$$$$$$$$. ..O......OO.....O.O.OOOO.O$$$$$$$$$$$$$$$. .........OO.OOO.O$$$$$$$$$$$$$$$$ ..O......OO.....O.O.OOOO.O$$$$$$$$$$$$$$$. OO...OOO.OO......OO.O..O.O$$$$$$$$$$$$$$$. O..O.OO.OO$....O$$$$$$$$$$$$$$$.. O..OOOOO.O$$$$$$$$$$$$$$$$....... .OO.O...OO.OO$$$$$$$$$$$$$$$$.... $O$$$$.....O$$$$$$$$$$$$ $$$$$....O...O$$$$$$$$$$$........ $$$$$...O$$$$$$$$$$$.........O..O $.OOOOO$$$.......O....O$$$$$$$$$$$...O.... $.O....O$$$......OOOOO$$$$$$$$$$$....O...O $.O$$$$$$$$$$$$$$$$OOOO. $..O...O$$$$$$$$$$$$$$$$ $....O$$$$$$$$$$$$$$$$.. $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$....OOOOOO$$$....... $$$$$$$$$$$$$....O.....O$$$...... $$$$$$$$$$$$$....O$$$$.. $$$$$$$$$$$$$.....O....O$$$...... $$$$$$$$$$$$$.......OO$$$........ $$$$.OO$$$$$$$$$$$$$.... $$$$OO.OO$$$$$$$$$$$$$.. $$$$.OOOO$$$$$$$$$$$$$.. $$$$..OO$$$$$$$$$$$$$... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$$$$$$....... $$$$$$$$$$$$......OOOOOO$$$$..... $$$$$$$$$$$$......O.....O$$$$.... $$$$$$$$$$$$......O$$$$$ $$$$$$$$$$$$.......O....O$$$$.... $$$$$$$$$$$$.........OO$$$$...... Moving the back two HWSS backwards and outwards by 6N cells, and also moving the back LWSS backwards by 12N cells, will produce a puffer whose period is increased by 120N, and which attempts to leave 3N more blinkers. If the top LWSS is removed, and replaced with a LWSS in the symmetrical position to the one at the bottom, then the puffer will also produce a backwards traveling glider. This concludes my addendum to the Spaceships in Conway's Life series. I would like to thank Harold McIntosh, Hartmut Holzwart, and especially Dean Hickerson for reviewing this article. From cellular-automata-request@Think.COM Tue Mar 2 10:27:33 1993 Received: by mail.think.com; Tue, 2 Mar 93 10:27:35 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 2 Mar 93 10:27:33 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 2 Mar 93 10:27:31 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA18710; Tue, 2 Mar 93 09:52:06 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 2 Mar 93 18:43:53 +1000 From: dhadler@zac.riv.csu.edu.au Organization: Charles Sturt University - Riverina, NSW, Australia Subject: C.A introduction Message-Id: <1993Mar2.184353.1@zac.riv.csu.edu.au> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM Please assist a new comer to the world of C.A. I'm an Australian arts lecturer (they exist) with a strong background in Video, computers and audio production. Currently lecturung electronic arts in Wagga Wagga which is 500k from anywhere. Recently attended the Third International Symposium on Electronic Arts and was introduced to C.A, G.A's, and the works of people like Karl Simms. Was most interested in Audio C.A work of Colin Beyls (I think that's right, it was a little while ago.) I have acouple of versions of Conways picked up from various FTP sites but am becoming a bit overwhelmed by the level of intellectual pursuit dedicated to it. I have programed some little 'animals' as code modules that exist in my computer and can interact with each other and their environment but can not as yet multiply. Their rules are pretty purile but not as mind crushingly simple as Conways. Yet Conways seems a more useful simulation. Feeling a little out of my depth I am asking if there are any good introductory texts etc that will get me started. I am particularly interested in the electronic arts applications of C.A and G.A's for that matter. This is primarily in audio generation with, perhaps, inclusion into electro mechanical feedback systems. My current work touches on resonation and recursion as an analogue of life. (real life that is). The life simulation aspects of C.A and the life, sex, death implications of G.A's are pretty intrguing in this context. Please e-mail or post in this group. Also interested in seeking out other electronic artists as we are a new course hungry for information and works. Deri Hadler dhadler@zac.riv.csu.edu.au (or) dhadler@golum.riv.csu.edu.au From cellular-automata-request@Think.COM Wed Mar 3 12:28:14 1993 Received: by mail.think.com; Wed, 3 Mar 93 12:28:16 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Wed, 3 Mar 93 12:28:14 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Wed, 3 Mar 93 12:28:09 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA20093; Wed, 3 Mar 93 12:03:12 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 3 Mar 93 04:12:27 GMT From: baez@ucrmath.ucr.edu (john baez) Organization: University of California, Riverside Subject: Re: k Message-Id: <26901@galaxy.ucr.edu> Newsgroups: comp.theory.cell-automata References: Sender: ca-request@Think.COM To: ca@Think.COM In article mark_a@cix.compulink.co.uk writes: >>As for the possible need for quantum mechanics, try to simulate solid >>bodies made of small parts that hang together stably without it. If you >>succeed, let the folks at the MIT cellular automaton group know, since >>they've been trying for years and haven't succeeded. Their failure is >>the basis for my conjecture that it's necessary. I'd be glad to see >>evidence either FOR or AGAINST this conjecture, I have no stake in it >>either way. > >Perhaps I'm misinterpreting you, but I think it's slightly misleading to >see quantum mechanics as some sort of bolt-on which holds matter together. >Matter/energy *is* the macroscopic manifestation of these quantum effects. >Trying to simulate matter, with 100% accuracy, without it isn't going to get >very far :-). The MIT group (and others) aren't trying to simulate our universe with 100% accuracy. They were just trying to simulate "objects" made of smaller "parts" on a cellular automaton, and have the objects stick together fairly stably. This is a basic qualitative feature of our universe: nucleons made of quarks, atoms made of electrons and nucleons, molecules made of atoms, and larger structures made of molecules being the basic examples. In all of the cases mentioned what we have are bound states, i.e. eigenvectors of the Hamiltonian, and the stability results from the fact that quantum-mechanical Hamiltonians admit discrete spectrum, while classical Hamiltonians have only continuous spectrum. It's not that quantum mechanics is some sort of "bolt-on", it's just that the discrete spectrum makes the thermodynamics work very differently (as Planck noticed from the very start when trying to understand blackbody radiation). The point that I was trying to make is that any obsession with >simulating the way things are in our universe could be a bad idea. What we >need to do is try to divine the essential properties that we require. I >believe e.g. an idealised "billiard ball" universe to have all the >(speculated) necessary properties of complexity/interaction to support AL. Yes, you can simulate a universal computer with it. But that requires setting up the computer "just right". One bit error and the whole thing can (typically) go kaflooey. It's possible that the billiard ball model supports a more "robust" sort of AL, but right now we haven't a clue. >I would be interested in hearing more on what the MIT CA group are trying to >do. Is this directed towards AL or physical simulation? Physical simulation, read Cellular automata machines : a new environment for modeling / Tommaso Toffoli, Norman Margolus. Cambridge, Mass. : MIT Press, c1987. Series title: MIT Press series in scientific computation. Unfortunately I don't think anything has been published about the solid body problem, mainly because so far there are just a bunch of failed attempts to simulate solid bodies. > How are you >classifying their failure, and has it been shown to be attributable to the >lack of QM events in the system? No, it hasn't been shown to be so, I simply said that they feel that might be the problem. It could easily be that they've overlooked a trick. Finding such a trick would be quite an achievement. If one tries for a while one gets a sense of how tricky it is. From cellular-automata-request@Think.COM Wed Mar 3 23:47:39 1993 Received: by mail.think.com; Wed, 3 Mar 93 23:47:57 -0500 Return-Path: Received: from Think.COM by mail.think.com; Wed, 3 Mar 93 23:47:39 -0500 Received: from unamvm1.dgsca.unam.mx ([132.248.10.1]) by Early-Bird.Think.COM; Wed, 3 Mar 93 23:47:31 EST Message-Id: <9303040447.AA29253@Early-Bird.Think.COM> Received: from UNAMVM1.DGSCA.UNAM.MX by unamvm1.dgsca.unam.mx (IBM VM SMTP V2R1) with BSMTP id 8434; Wed, 03 Mar 93 22:48:46 MEX Received: from UNAMVM1 (MCINTOSH) by UNAMVM1.DGSCA.UNAM.MX (Mailer R2.10 ptf000) with BSMTP id 8433; Wed, 03 Mar 93 22:48:45 MEX Date: Wed, 03 Mar 93 22:46:39 MEX From: "Harold V. McIntosh" Subject: Fredkin's mechanics. To: "(Cellular Automata)" In the ongoing discussion about creating a cellular automaton universe, someone mentioned work at MIT; john baez has just said: > > Unfortunately I don't think anything has been published about the solid > body problem, mainly because so far there are just a bunch of failed > attempts to simulate solid bodies. > By and large, this seems to be the story. Fredkin himself gave a presentation at CA89 in Los Alamos; an account can be found in - Edward Fredkin Digital Mechanics Physica D 45 254-270 (1990). - This issue, the conference proceedings, edited by Howard Gutowitz, has been reprinted by both North Holland, and the MIT Press. - Fredkin's ideas have also had their share of attention in the popular press, but nothing that I have seen carried much detail. - Harold V. McIntosh |Depto. de Aplicaci'on de Microcomputadoras MCINTOSH@UNAMVM1.BITNET |Instituto de Ciencias/UAP mcintosh@unamvm1.dgsca.unam.mx |Apdo. Postal 461 (+52+22)43-6330 |72000 Puebla, Pue., MEXICO From cellular-automata-request@Think.COM Thu Mar 4 05:49:44 1993 Received: by mail.think.com; Thu, 4 Mar 93 05:49:47 -0500 Return-Path: Received: from Think.COM by mail.think.com; Thu, 4 Mar 93 05:49:44 -0500 Received: from pamir.inria.fr by Early-Bird.Think.COM; Thu, 4 Mar 93 05:49:41 EST X400-Received: by /PRMD=inria/ADMD=atlas/C=FR/; Relayed; 04 Mar 93 11:48:23+0100 X400-Received: by /PRMD=cea/ADMD=atlas/C=FR/; Relayed; 04 Mar 93 11:46:59+0100 Date: 04 Mar 93 11:46:59+0100 From: Howard Andrew GUTOWITZ Message-Id: <9303041046.AA00345(a)amoco.saclay.cea.fr> To: ca@Think.COM Subject: Fredkin A nice pop source on Fredkin is: "Three Scientists and their Gods" Robert Wright, Times Books, A division of Random House 1988 From cellular-automata-request@Think.COM Thu Mar 4 14:15:05 1993 Received: by mail.think.com; Thu, 4 Mar 93 14:15:16 -0500 Return-Path: Received: from Think.COM by mail.think.com; Thu, 4 Mar 93 14:15:05 -0500 Received: from noc.BelWue.DE by Early-Bird.Think.COM; Thu, 4 Mar 93 14:14:32 EST Received: from sunslc1.rz.uni-mannheim.de by noc.BelWue.DE with SMTP id AA00183 (5.65c/BelWue-M2.04 for ); Thu, 4 Mar 1993 20:14:21 +0100 Received: from charon.stat.uni-mannheim.de by sunslc1.rz.uni-mannheim.de (4.1/BelWue-1.1Sma1(subsidiary)) id AA14701; Thu, 4 Mar 93 20:07:38 +0100 Received: From MAKRO/AIAKOS by charon.stat.uni-mannheim.de via Charon-4.0A-VROOM with IPX id 100.930304201339.320; 04 Mar 93 20:18:10 -0200 Message-Id: To: cellular-automata@Think.COM> From: "Ulrich Schwalbe" Organization: Uni Mannheim, dep. of economics Date: 4 Mar 93 20:13:31 GMT+100 Subject: help on CA Reply-To: schwalbe@econ.uni-mannheim.de Priority: normal X-Mailer: Pegasus Mail v2.3 (R5). Hi CA-Group, I am an economist working on the interaction of bounded rational individuals in evolutionary games and try to model such a population as a cellular automaton. Since CAs are almost unknown in economics, my information about the subject is rather limited. (I've got the book by Wolfram: `Theory and Applications of CA' and the one by Gutowitz: CA.) So I would appreciate very much if I could get some help on the following questions: 1) Is there a recent survey on the main mathematical results in CA- Theory (one/two-dimensional, deterministic/stochastic)? 2) Is there any work on the relationship CAs-(random) Boolean networks with arbitrary neigbourhood structure? 3) Has there been any extension/connection of CAs to/with Lindenmayer- systems? I am thankful for every hint! Ulrich Schwalbe Ulrich Schwalbe University of Mannheim LS VWL, Wirtschaftstheorie Postfach 103462 6800 Mannheim 1 Germany Email: schwalbe@econ.uni-mannheim.de From cellular-automata-request@Think.COM Thu Mar 4 17:05:43 1993 Received: by mail.think.com; Thu, 4 Mar 93 17:05:48 -0500 Return-Path: Received: from Think.COM by mail.think.com; Thu, 4 Mar 93 17:05:43 -0500 Received: from cns.bu.edu (PARK.BU.EDU) by Early-Bird.Think.COM; Thu, 4 Mar 93 17:05:40 EST Received: from RETINA.BU.EDU by cns.bu.edu (5.61+++/SMI-4.0.) id AA20602; Thu, 4 Mar 93 16:49:04 -0500 Received: by retina.bu.edu (5.61+++/SMI-4.0) id AA26736; Thu, 4 Mar 93 16:49:13 -0500 Date: Thu, 4 Mar 93 16:49:13 -0500 From: dlukas@PARK.BU.EDU Message-Id: <9303042149.AA26736@retina.bu.edu> To: TheoryNet@ibm.com, ai-ed@sun.com, ailist@KL.SRI.COM, anneal@cs.ucla.edu, arpanet-bboards@mc.lcs.mit.edu, biomch-l@hearn.bitnet, biotech@umdc.umd.edu, cellular-automata@Think.COM, connectionists@MAILBOX.SRV.CS.CMU.EDU, crtnet@psuvm.bitnet, cybsys-l@bingvmb.bitnet, dasp-l@csearn.bitnet, denny@tss.com, dynsys-l@uncvm1.bitnet, human-nets@aramis.Rutgers.EDU, hypercube@hubcap.clemson.edu, ieee-l@bingvmb.cc.binghamton.edu, image-l@trearn.bitnet, info-futures@encore.com, ir-l%uccvma.bitnet@vm1.nodak.edu, issnnet-mlist@PARK.BU.EDU, lantra-l@finhutc.bitnet, na@sccm.Stanford.EDU, neuron@hplabs.hpl.hp.com, nl-kr@cs.rochester.edu, optics-l@taunivm.bitnet, para-dap@irlearn.bitnet, psyc@pucc.bitnet, psycgrad@acadvm1.uottawa.ca, simulation@ufl.edu, soft-eng@mwunix.mitre.org, vision-list@ads.com Subject: World Conference on Neural Networks '93 (July 11-15, Portland, Oregon, USA) WORLD CONGRESS ON NEURAL NETWORKS 1993 Annual Meeting of the International Neural Network Society July 11-15, 1993, Portland, Oregon WCNN'93 is the largest and most inter-disciplinary forum in the neural network field today. COOPERATING SOCIETIES: American Association for Artificial Cognitive Science Society Intelligence European Neural Network Society American Mathematical Society IEEE Computer Society American Physical Society IEEE Neural Networks Council American Psychological Society International Fuzzy Systems Association Association for Behavior Analysis Japanese Neural Network Society Classification Society of North Society for Mathematical Biology America Society for Mathematical Psychology Society of Manufacturing Engineers PLENARY SPEAKERS INCLUDE: Stephen Grossberg, 3-D Vision and Figure-Ground Pop-Out Bart Kosko, Neural Fuzzy Systems Carver Mead, Real-Time On-Chip Learning in Analog VLSI Networks Kumpati Narendra, Intelligent Control Using Neural Networks Wolf Singer, Coherence as an Organizing Principle of Cortical Function TUTORIALS INCLUDE: Gail Carpenter, Adaptive Resonance Theory Robert Desimone, Cognitive Neuroscience Walter Freeman, Neurobiology and Chaos Robert Hecht-Nielsen, Practical Applications of Neural Network Theory Michael Kuperstein, Neural Control and Robotics S.Y.Kung, Structural and Mathematical Approaches to Signal Processes V.S. Ramachandran, Biological Vision David Rumelhart, Cognitive Science Eric Schwartz, Neural Computation and VLSI Fred Watkins, Neural Fuzzy Systems Hal White, Supervised Learning INVITED SPEAKERS INCLUDE: James A. Anderson, Programming in Associative Memory Gail A. Carpenter, Adaptive Resonance Theory: Recent Research and Applications Michael A. Cohen, Recent Results in Neural Models of Speech and Language Perception and Recognition Judith E. Dayhoff, Applications of Temporal and Molecular Structures in Neural Systems Walter Daugherty, A Partially Self-Training System for the Protein Folding Problem Kunihiko Fukushima, Improvement of the Neocognitron and the Selective Attention Model Armin Fuchs, Brain Signals during Qualitative Changes in Patterns of Coordinated Movements Stephen Grossberg, Learning, Recognition, Reinforcement, Attention, and Timing in a Thalamo-Cortico-Hippocampal Model Dan Hammerstrom, Whither Electronic Neurocomputing? R. Hecht-Nielsen, Towards a General Theory of Data Compression James C. Houk, Spatiotemporal Patterns of Activity in an In Vitro Recurrent Network Mitsuo Kawato, Existence of an Inverse Dynamics Model in the Cerebellum Teuvo Kohonen, Boosting the Computing Power in Pattern Recognition by Unconventional Architectures S.Y. Kung, On Training Temporal Neural Networks Michael Kuperstein, Neural Controller for Catching Moving Objects in 3-D Daniel Levine, A Gated Dipole Architecture for Multi-Drive, Multi- Attribute Decision Making Erkki Oja, Nonlinear PCA: Algorithms and Applications Michael P. Perrone, Learning from what's been Learned: Supervised Learning in Multi-Neural Network Systems Michael T. Posner, Tracing Network Processes in Real Time with Scalp Electrodes Robert Sekuler, Perception of Motion: How the Brain Manages Those Thousand Points of Light John G. Taylor, M Forms of Memory Thomas P. Vogl, From Electrophysiology to a Stable Associative Learning Algorithm Allen Waxman, Rats, Robots, Monkeys and Missiles: Neural Pathways in Robot Intelligence Paul J. Werbos, Supervised Learning: Can We Escape from its Local Optimum? Bernard Widrow, Adaptive Signal Processing Shuji Yoshizawa, Dynamics and Capacity of Neural Models of Associative Memory Hussein Youssef, Comparison of Several Neural Networks in Nonlinear Dynamic System Modeling Lotfi A. Zadeh, Soft Computing, Fuzzy Logic and the Calculus of Fuzzy Graphs GENERAL CHAIR: George G. Lendaris MAIN PROGRAM CHAIRS: Stephen Grossberg and Bart Kosko SME/INNS TRACK PROGRAM CHAIRS: Kenneth Marko and Bernard Widrow IFSA/INNS TRACK PROGRAM CHAIRS: Ronald Yager and Paul Werbos COOPERATING SOCIETIES CHAIR: Mark Kon INNS OFFICERS: President: Harold Szu President-Elect: Walter Freeman Past President: Paul Werbos Executive Director: Morgan Downey BOARD OF GOVERNORS: Shun-ichi Amari Richard Andersen James A. Anderson Andrew Barto Gail Carpenter Leon Cooper Judith Dayhoff Kunihiko Fukushima Lee Giles Stephen Grossberg Mitsuo Kawato Christof Koch Teuvo Kohonen Bart Kosko C. von der Malsburg David Rumelhart John Taylor Bernard Widrow Lotfi Zadeh FOR REGISTRATION AND ADDITIONAL INFORMATION PLEASE CONTACT: WCNN'93 Talley Management Group 875 Kings Highway, Suite 200 West Deptford, NJ 08096 Tel: (609) 845-1720 FAX: (609) 853-0411 e-mail: registration@wcnn93.ee.pdx.edu Please do not reply to this account. Please use the telephone number, fax number, U.S. Mail address, or email address listed above. From cellular-automata-request@Think.COM Fri Mar 5 03:31:06 1993 Received: by mail.think.com; Fri, 5 Mar 93 03:31:10 -0500 Return-Path: Received: from Think.COM by mail.think.com; Fri, 5 Mar 93 03:31:06 -0500 Received: from noc.BelWue.DE by Early-Bird.Think.COM; Fri, 5 Mar 93 03:30:47 EST Received: from sunslc1.rz.uni-mannheim.de by noc.BelWue.DE with SMTP id AA12771 (5.65c/BelWue-M2.04 for ); Fri, 5 Mar 1993 09:30:21 +0100 Received: from charon.stat.uni-mannheim.de by sunslc1.rz.uni-mannheim.de (4.1/BelWue-1.1Sma1(subsidiary)) id AA15897; Fri, 5 Mar 93 09:23:38 +0100 Received: From MAKRO/AIAKOS by charon.stat.uni-mannheim.de via Charon-4.0A-VROOM with IPX id 100.930305092940.480; 05 Mar 93 09:34:25 -0200 Message-Id: To: cellular-automata@Think.COM From: "Ulrich Schwalbe" Organization: Uni Mannheim, dep. of economics Date: 5 Mar 93 09:29:38 GMT+100 Subject: help on CA Priority: normal X-Mailer: Pegasus Mail v2.3 (R5). Hi CA-Group, I am an economist working on the interaction of bounded rational individuals in evolutionary games and try to model such a population as a cellular automaton. Since CAs are almost unknown in economics, my information about the subject is rather limited. (I've got the book by Wolfram: `Theory and Applications of CA' and the one by Gutowitz: CA.) So I would appreciate very much if I could get some help on the following questions: 1) Is there a recent survey on the main mathematical results in CA- Theory (one/two-dimensional, deterministic/stochastic)? 2) Is there any work on the relationship CAs-(random) Boolean networks with arbitrary neigbourhood structure? 3) Has there been any extension/connection of CAs to/with Lindenmayer- systems? I am thankful for every hint! Ulrich Schwalbe Ulrich Schwalbe University of Mannheim LS VWL, Wirtschaftstheorie Postfach 103462 6800 Mannheim 1 Germany Email: schwalbe@econ.uni-mannheim.de From cellular-automata-request@Think.COM Sat Mar 6 03:29:33 1993 Received: by mail.think.com; Sat, 6 Mar 93 03:29:36 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sat, 6 Mar 93 03:29:33 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sat, 6 Mar 93 03:29:31 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA26990; Sat, 6 Mar 93 03:14:13 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 4 Mar 93 19:03:52 GMT From: nystrom@ted.cs.uidaho.edu (Jim Nystrom) Organization: University of Idaho CS Dept. Subject: Re: k Message-Id: Newsgroups: comp.theory.cell-automata References: , <26901@galaxy.ucr.edu> Sender: ca-request@Think.COM To: ca@Think.COM The 'solid-body' problem is quite interesting as it relates to current methods of AL. My contention in my paper Computational Cosmography is that 'structure' can not be supported by 2-dimensional CA's. By only operating on a plane, the interactions will never have any analogy- connection with the physical phenomona that surrounds us. What does this mean? It implies that a multi-dimensional CA is needed. Then what? Of course proper rules are needed, and this is where the discussion of modelling quantum interactions comes into play - because this science is viewed as the rules of universe's-operating-the-way-it- does. But, is quantum mechanics the way to approach multi-dimensional CA's? No, because QM has some serious problems - the problem is the use of force carriers to explain phenomona - witness the desire to find gravitons (sp?). Some type of rule system is needed that is built from the idea that strucutre is central to the rule system - witness the synergetic geometry of R. Buckminster Fuller. In synergetics, multi-dimensionality is inherent the geometry rules, Fuller has identified A,B,T,S,... modules, of which some are energy conserving and others are energy dissipating. The geometry also includes ideas on the structure of space - interconnected matrix of vector equilibrium, otherwise known as the octet-truss. This is very appealing to the possibility of modelling solid-bodies, because solid bodies do not exist in vaccu, but reside in space (which by know we know is full of energy and activity). Compare this to 2D CA's, were the structure of space by default is defined as an x-y type grid. end rambling. Jim F. Nystrom nystrom@ted.cs.uidaho.edu From cellular-automata-request@Think.COM Sun Mar 7 15:29:56 1993 Received: by mail.think.com; Sun, 7 Mar 93 15:30:00 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Sun, 7 Mar 93 15:29:56 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Sun, 7 Mar 93 15:29:52 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA05406; Sun, 7 Mar 93 15:27:45 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Sun, 7 Mar 1993 18:18:07 GMT From: james@panix.com (James Britt) Organization: PANIX Public Access Unix, NYC Subject: Re: help on CA Message-Id: Newsgroups: comp.theory.cell-automata References: Sender: ca-request@Think.COM To: ca@Think.COM Stuart Kauffman has done work with random Boolean networks. See his article in Alife II, or better yet, get his book The Origins of Order, from Oxford Press. -- ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: Just another speed-metal vegetarian anarchist cyberhippie Zen Socratic... Diblo Rules! Hack The Wetware! james@panix.com ............................................................. From cellular-automata-request@Think.COM Mon Mar 8 02:00:53 1993 Received: by mail.think.com; Mon, 8 Mar 93 02:00:56 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 8 Mar 93 02:00:53 -0500 Received: from clio.rz.uni-duesseldorf.de by Early-Bird.Think.COM; Mon, 8 Mar 93 02:00:46 EST Received: by clio.rz.uni-duesseldorf.de (5.64/10.0) id AA28041; Sun, 7 Mar 93 20:48:19 +0100 Date: Sun, 7 Mar 93 20:48:19 +0100 From: beckmanj@clio.rz.uni-duesseldorf.de (Beckmann) Message-Id: <9303071948.AA28041@clio.rz.uni-duesseldorf.de> To: TheoryNet@ibm.com, ai-ed@sun.com, ailist@KL.SRI.COM, anneal@cs.ucla.edu, arpanet-bboards@mc.lcs.mit.edu, biomch-l@hearn.bitnet, biotech@umdc.umd.edu, cellular-automata@Think.COM, connectionists@MAILBOX.SRV.CS.CMU.EDU, crtnet@psuvm.bitnet, cybsys-l@bingvmb.bitnet, dasp-l@csearn.bitnet, denny@tss.com, dlukas@PARK.BU.EDU, dynsys-l@uncvm1.bitnet, human-nets@aramis.Rutgers.EDU, hypercube@hubcap.clemson.edu, ieee-l@bingvmb.cc.binghamton.edu, image-l@trearn.bitnet, info-futures@encore.com, ir-l%uccvma.bitnet@vm1.nodak.edu, issnnet-mlist@PARK.BU.EDU, lantra-l@finhutc.bitnet, na@sccm.Stanford.EDU, neuron@hplabs.hpl.hp.com, nl-kr@cs.rochester.edu, optics-l@taunivm.bitnet, para-dap@irlearn.bitnet, psyc@pucc.bitnet, psycgrad@acadvm1.uottawa.ca, simulation@ufl.edu, soft-eng@mwunix.mitre.org, vision-list@ads.com Subject: Re: World Conference on Neural Networks '93 (July 11-15, Portland, Oregon, USA) From cellular-automata-request@Think.COM Mon Mar 8 15:03:12 1993 Received: by mail.think.com; Mon, 8 Mar 93 15:03:15 -0500 Return-Path: Received: from Think.COM by mail.think.com; Mon, 8 Mar 93 15:03:12 -0500 Received: from sun2.nsfnet-relay.ac.uk by Early-Bird.Think.COM; Mon, 8 Mar 93 15:02:52 EST Via: uk.ac.birmingham.computer-science; Mon, 8 Mar 1993 17:52:49 +0000 Received: from fat-controller.cs.bham.ac.uk by percy.cs.bham.ac.uk with SMTP (PP) id <06182-0@percy.cs.bham.ac.uk>; Mon, 8 Mar 1993 16:34:22 +0000 Received: by fat-controller.cs.bham.ac.uk (4.1/client/1.2) id AA24020; Mon, 8 Mar 93 16:34:14 GMT Date: Mon, 8 Mar 93 16:34:14 GMT From: aisb93-prog@computer-science.birmingham.ac.uk Message-Id: <24020.9303081634@fat-controller.cs.bham.ac.uk> To: ca@Think.COM Subject: AISB'93 Final Call ________________________________________________________________________ FINAL CALL FOR REGISTRATION A I S B' 9 3 The University of Birmingham March 29th -- April 2nd 1993 ________________________________________________________________________ The Artificial Intelligence and Cognitive Science conference AISB'93 will take place this year at the University of Birmingham from March 29th till April 2nd, with the general theme 'Prospects for Artificial Intelligence'. We are pleased to announce that in addition to the previously announced prize offered by Integral Solutions Ltd. for the best presented paper, there is also a prize donated by Wiley for the technically best paper, consisting of the new edition of the Encyclopaedia of AI. The Conference Dinner will be in Birmingham's Repertory Theatre overlooking Centenary Square. * For a programme and registration form please email the auto-reply service aisb93-info@cs.bham.ac.uk * Other enquiries: AISB'93, School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, U.K. Phone: +44-(0)21-414-3711 Fax: +44-(0)21-414-4281 Email aisb93-prog@cs.bham.ac.uk From cellular-automata-request@Think.COM Mon Mar 8 20:58:48 1993 Received: by mail.think.com; Mon, 8 Mar 93 20:58:52 -0500 Return-Path: <@CUNYVM.CUNY.EDU,@PACEVM.BITNET:MARCHESF@PACEVM.BITNET> Received: from Think.COM by mail.think.com; Mon, 8 Mar 93 20:58:48 -0500 Received: from CUNYVM.CUNY.EDU by Early-Bird.Think.COM; Mon, 8 Mar 93 20:58:43 EST Message-Id: <9303090158.AA05637@Early-Bird.Think.COM> Received: from PACEVM.BITNET by CUNYVM.CUNY.EDU (IBM VM SMTP V2R2) with BSMTP id 7899; Mon, 08 Mar 93 20:57:44 EST Received: from PACEVM (NJE origin MARCHESF@PACEVM) by PACEVM.BITNET (LMail V1.1d/1.7f) with BSMTP id 6895; Mon, 8 Mar 1993 20:59:16 -0500 Date: Mon, 08 Mar 93 20:58:34 EST From: "Dr. Francis T. Marchese" Subject: Conference To: cellular-automata@Think.COM NYC / ACM SIGGRAPH and PACE UNIVERSITY's School of Computer Science and Infor mation Systems Presents a conference on UNDERSTANDING IMAGES on Fri day & Saturday May 21-22,1993 9 a.m.- 6 p.m. at The Pace Downtown Theat er One Pace Plaza (on Spruce Street between Park Row & Gold Street) New Yo rk, NY 10038 UNDERSTANDING IMAGES Artists, designers, scientists, engineer s and educators share the problem of moving information from one mind to anothe r. Traditionally, they have used pictures, words, demonstrations, music and da nce to communicate imagery. However, expressing complex notions such as God and infinity or a seemingly well defined concept such as a flower can present chal lenges which far exceed their technical skills. The explosive use of computers as visualization and expression tools has compounded this problem. In hypermed ia, multimedia and virtual reality systems vast amounts of information confront the observer or participant. Wading through a multitude of simultaneous images and sounds in possibly unfamiliar representations, a confounded user asks: Wha t does it all mean? Since image construction, transmission, reception, decipher ment and ultimate understanding are complex tasks strongly influenced by physiol ogy, education and culture; and since electronic media radically amplify each pr ocessing step, then we, as electronic communicators, must determine the fundamen tal paradigms for composing imagery for understanding. Therefore, the purpose o f this conference is to bring together a breadth of disciplines, including, but not limited to, the physical, biological and computational sciences, technology, art, psychology, philosophy, and education, in order to define and discuss the issues essential to image understanding within the computer graphics context. FEATURED SPEAKERS * Psychology/Perception "Masaccio's Bag of Trick s" Marc De Mey, University of Ghent University and Variability in Human "Vi sual Information Processing" Beverly J. Jones, School of Architecture and Appli ed Arts, University of Oregon "Some Speculations About Graphic Communication" Barbara Tversky, Psychology Department, Stanford University "Implementation of Collaborative Multimedia Technologies in Urban Planning Situations" Michae l J. Shiffer, Computer Resource Laboratories, MIT "Photographic Interpretatio n" Tom Hubbard, School of Journalism, Ohio State University * Image Analysis "Is Alligator Skin More Wrinkled than Tree Bark? The Role of Texture in Obj ect Description" A. Ravishankar Rao, IBM Watson Research Center and Nalini Bhu shan, Philosophy Department, Smith College "The Ruling Effect of Contours, Su rface Markings and Background in Perception of Shape from Shading" Xiaoping Hu and Narendra Ahuja, Beckmann Institute and Department of ECE, University of Il linois "Composing and Understanding SpatialImages" Les M. Sztandera, Electri cal Engineering Department, University of Toledo * Design "Aesthetics and Nature: The Manufacturing of an Authoritative Voice in Scientific Visualization " Mark Bajuk, NCSA, U. of Illinois "Design Issues" Alyce Kaprow, MIT * Text "Visualization for the Document Space" Xia Lin, Law Library, Pace Uni versity "Automating Procedures for Generating Chinese Characters" John Lous tau and Jong-Ding Wang, Computer Science Department, Hunter College "Visual L anguage" Judson Rosebush, Judson Rosebush Company, NY * Sound "Neuromusic " Matthew Witten and Robert Wyatt, U. of Texas and Center for High Performanc e Computing "Gesture Translation: Using Conventional Musical Instruments in Unconventional Ways" Robert S. Williams, Computer Science Department, Pace Uni versity "Sonic Issues" Rory Stuart, NYNEX * Philosophy "The Metaphysic s of Virtual Reality" Michael Heim, Education Foundation of DPMA HOTEL ACCOM MODATIONS: The Hotel Millenium 55 Church Street New York, New York 10048 Te l: (212) 693-2001 (800) 835-2220 Fax: (212) 571-2317 Please call the hotel di rectly for reservations and mention Pace U./ACM NYC SIGGRAPH. (Reservations must be made by May 10, 1993) Special conference rate: $125 per night +tax Single/ Double Check-out: 2 pm Check-in: 3 pm (Note: Hotel is within walking distance of conference.) For informational purposes only: Date of arrival:____ \ ____ \ ____ Date of departure: ____\____\____ ____ Millenium ____ Other ________ __________ Please Specify AIR TRAVEL ACCOMODATIONS: Continental Airlines (800) 525-0280 Valid Travel Dates are May 19, 1993 through May 30, 1993. Plea se call directly for reservations. * Continental will offer a 45% discount off the full "Y" coach fare and "F" first class fare. Discounts do not apply to Bus inessFirst. No other restrictions apply. * Additionally, a 5% discount off a ll fares, subject to availability. Discounts do not apply to BusinessFIrst. Al l rules and restrictions apply. * No discount will apply to any ticket issued within seventy-two (72) hours of departure. * Passenger Facility Charge (PFC ) may apply if traveling to a city where the airport has implemented this tax. * Discounts do not apply to government, military, senior fares, promotional fare s or Newark/Boston and Newark/Washington routes. Travel discount certificates c an not be used in conjunction with meeting / convention discounts. For informat ional purposes only: ___ Continental Airlines ___ Other _____________ Please Specify ______________________________________________________________________ __ CONFERENCE ON UNDERSTANDING IMAGES Registration Information (Please print or type) ________________________________________ Name _______________ _________________________ Title ________________________________________ Comp any ________________________________________ Address ________________________ _________________________________________ City State ZIp (______) ______-________ (______) ______-________ Day P hone Evening Phone ____________________________ _________ ________ Email FAX REGISTRATION FEES (Includes continental breakfast, breaks, and lunch) Pre-registration (before May 1, 1993) ___ ACM/SIGGRAPH member $55 ___ Non-member $75 ___ Student regi stration $40* *(before May 1, 1993 & proof of F/T status required) Registrat ion ___ after May 1st or On-Site $95 Please make checks payable to NYC/ACM SIGGRAPH and remit by May 1, 1993. Send registration information & fees to: Dr. Francis T. Marchese Computer Science Department NYC/ACM SIGGRAPH Confe rence Pace University 1 Pace Plaza Room T-1704 New York, New York 10038 vo ice:(212)346-1803 fax:(212)346-1933 Email: MARCHESF@PACEVM.bitnet From cellular-automata-request@Think.COM Tue Mar 9 10:31:27 1993 Received: by mail.think.com; Tue, 9 Mar 93 10:31:30 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 9 Mar 93 10:31:27 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 9 Mar 93 10:30:55 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA27940; Tue, 9 Mar 93 10:29:45 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 9 Mar 1993 14:51:06 GMT From: heitkoet@lusty.informatik.uni-dortmund.de (Joerg Heitkoetter) Organization: CS Department, Dortmund University, Germany Subject: Texinfo version of "Spaceships" by David Bell (3/3) Message-Id: <1niasqINNj1o@fbi-news.Informatik.Uni-Dortmund.DE> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM ------- glue here ------------------------------------------- M18V=MVIB(\"JN4:YNFE @3*2##JQ8)A/B#ALBBUR=VE&?JY8!L SOGM:MX(Z MMSE>%'0<:"ZCM8*L>_E]!\!>3.*_%#M!P(!$7%3*&6!Q6' M*WYT'4=V7(N,9V'V"]8:*XUUI+"VI;_T+'' 1WH.N]Z[^"JY&=TKUI&+!J5@ M#I&-6/>G9[P86S%6#I[9P-6_L%G! M-D0Z)#NGA#F^!7,!O'"]%(Y*P#ZW7DT:OJB)X+\J:J4QZ(MNBWR*J$0R:D!> M?H1Y@6$]+\!**0^$-$KGOZ2U'[ZVD' X +;F6VW [[]TNRLZ!L$S8(F$';J^ MKZXULZ^83Y09YXHLN(N)-H-8@-.U(L$@P1^,)8I?@&ELBJ7G@PNZ0G[B@D6P M,(0A8K+"L%)=0?!BEK%AC>[+\!?<#Z\ <%- M:HYP:VG(G8WP5\\ M6<"$C5W!V#7AN):WRW( P3+!WC@FODMJ[,!X. 2VLD_MOTK!&3MXB41R_8LS MP9H]-;M'P3_!(VGRB^W ^[^!66G ^\ 4AT2-DT>&ACZY3I7W=1DZ#2\OP3# M]H!XP>6+HF@HP7ZZ&56F5IDG0&D\2Y/!4DLDP9#!EHT_715B*<&,P?^C=X(6 MP2W +\&'O2N)0(MKP&N^"8RG,O; 6\'77TU/U3@\P8>%(U*7C?>(<'5.BY9F M<<'^P).XAHTYO*7!6L"\P0X[$[R>-/? <<&&,F'!9*VGO$_!QL'#P]:>%5^8( :]Y2Z8O8%[P>_CUEL4@,-6?F\U5[V2EDAY5Y$HER47Y3L M%[,A!%DF'<-YTV=42:=):FKO=#1$V ;CL58'_I"^+38G#8-[GPD$V[25MGYE M@GE)1- 7*Q."JQM $C)?E(TA^L$!"/S!]BB9O?_!=)\'>3) %L(4"'B4&<+R M"P\,39]1HWL-W6K5K9P'&0./DNDI-RPFE6I.(BQ+;N$9 I*^KL(IX7^$6_.( M;KFQ8 LCOFPY,6223DOC31P\_R)&PGHX5CA"PM=P(;J\B=Z?O3C6,F*2J2=> MC(H[89*+9A5[L$Z>3Z-HHVA#4#U+9#@Y69=C:'/@9J>ZYB2"HU3"H$]1PC9E M/VJHB6C"7&4ANMJ%9,*1A"552'*(N73"7,+XAY)=VZ'/E S4)%B?<(L M77O""&E3PH#"2,+LMU#"9C:O1$3"Y%6D94_"@3&#PFG"1(F-PO"P4L*4POIR MCL+S0-@U/\+%+$?":X:/A7]F$<$T_@U=9-*-\63OFF=* M:@]*O.Y1W%QB5QXS#V/_$-S!V!-9K+A/1'IEL"E]6UA@#ZAXQL(J!S03AS8) M&GD#S2>(D9->6*I8!-N83 M\64OKWGH].W)SW9MV]RCVZ_GC7#.L.<4#_#>6]2E7:V.,-^O47#%+P\P_S MAUM,ODO#3[[SHPVW-\-'PT;#,\,AO'"U2<,'=-6WMHD(>SQ?)(3!6<0]:K%@ MPS=U8<.T5L4LIW;DA9MU:,,TL.6]VU0W5!(N V9X=12'XGURPQI^=,.9.\FZ MM;SNNI3# (1MPZK#KWRU7%B51W6QPS^E?%02:6+#ML,=:+?#.FI8 MP[>\O,.VN+W#I5O7O'2VBG-Y=T8DS5(##G,.: MPR]P"+J8;B)2N[PDI<-RDL/PPR>8\L/ML%3#93? 5XK#\<.1P]NCK,.5PX3# M/[T9<>G#F\/HPV)PZL/,J^+#>L.)F9AT<\/;P][##<0Z@04Q$,08=A+$^T7/ MP]/#TL-IPS^E7\.YPS&)',0D<6K"YW"^PR'$Q\,CQ";!C,-(OBR*/Q'V]F<0P M/%+#C[V;Q%N5G\3!::'$':%7P]:WWW&=Q'93I<3 KV6V(HH$I*;$BE 85MHA M-#7K;& SOP/#)Y,VU5&*$*9%CR90+%@Y/ .4;2%)=@F& SH/T 2= 80;XEXS M-E<5 C["H($9E0R./M(?4T:G Z0&2)HLPA]YI@,!P_1J@7D@:\D5L3@M]UY,"K60W#>!5'(3##3F5^MD'#.KF:4!RX-L/0D24I M1R&P=^&(X,)R&;>P&!5&!08*W28P'2\^##D3!F^^+U.L4&-G@0-S9E>LPD1>7@^5'GL)>Q2<2:$@H40/B%_>!8U M4*"$#IN/?AMHI%9LUAHN6"$F/7STC^>$:11 M1U2-\5W>((0ST_N*##"M<#I M)6"F;G\$D7E\%(A"Q1FC5\6'%UG%#R&BI%U< )5+$PA\ DZ=P F[$A*E$>/$ M H;C937"T 1=<1\'?BWHQ-^Z6K5DA(&5]\1!;80Z +FC<.%].;P45?^'@U,> MP:_#D7'5PTISF#C1NK^'R3!9P !65[V^3L-7#,&"E8B5E;TM/)+$2K[NQ/ZC M"7%64J_$>#B@4(*+H8?_Q'[!!J3KQ*8G1,,T/5G 2+6KQ'F]T<7*<.[$8+9A MOOO$;[N^Q<7%&;SH9^>WNL55P\>O"3'!O/"'9DR%=3I9GU3,=#-=V'*L6SUE M^#+_-AUFJ<5TPB:]Q4T%MC2]+VWT,D&]A+:MQ!:W'ST;YI3JJ_Y#Y\OJB?+0SZ6S2/2&]H#_>40DIJ#0@18WJB2F>O\ELK7.EU M2'G/EFT/E$K#8=\_Y'03M;P!(C^LP@RUXW:I"0-EUL#J#.B6>$"0926?WCWN)B:VBAV*?3DK M-'<4<@E[GD3<33)4S6NGN-].F#O4?4_&3G-1QNER[;8U:3QF,+NG6Z5<(*?# M++-&],!!QG*%0\8/.IC#[7WY8SO&CKRR8!K%>5D@Q9P0&1T.5SALOSFQ!1.* M X"GYP''UIO:9RL&2-LT<" MH=:-8JFKEM0#BSFE%9U1#5C&F=KB'P,61:@/G)68&S;^-HIMIMYTP">8E-1=F6J$3 M!PKOB2/%]P?2AGD3K$E(P5MW<&G%H@-!! :I$P5D7X*.8YWK(H$C3.Z%9(6"*B.+GSS1N,;HIAK;R@8 MMVR/A%6XJV"R7!ZXREV-C399]'P.@FEF!HD.@J>WNEVCP6[$>\0T,MD8,<0T!2RVZ?\60CIP7460NQD.D@[\L,S&Z>'X4 MDNM/^D0^M1U*+#.VB\@($BQJ$)@'%8KA?_S&SH>[Q4%0PF@@Q&&7G2\VBY(W M"W*Z?PC$1<;0=(EZ/[9$:41^MHFI95INKWMC,1"Z,FF]HK&U7F9_A#.X_%/0 M565IM6@T:8=314R$<$E^6K@0NJNYOUI[=[I[@F=LQ%%S668,553'#8*QMZ-I MY8HO68B\);[1>_Z37Q6>AQK A,>@97_'T'>!QU?';L081F2+%48H:9%O",4I MQ&#'/HGGQ;*\M6I$9IFZ+9F+=GN$FSN@=FW'.FEOQW2!HD1VK1INL,7M39;' M7<=S67G''51%Q)/'6H'T&J&*BXC'Q1'.BL/%/+ZE M6!N,4%4[OF2#GG/]<%/!6,=+Q")W F:11^^K68 Z:Y94MVA$;:W'K[J-AFEI M)[;<.U."H\?%O#!*5'ULATE585#7QSN%'Z7:QT5J=L?&A@9IHV<*>T;$=G)G M*C9!3CSO.X9[P<5V=R9^7,>!6K]RJS+GQSM^&7?IAZ;'W<=4N+$RX,>'QQC(9L?E MQZ&LJ\?,B;/##KSQ:-/''6D<=[QJHH\HQ&(YJ$5<(8/'>@59 ;M> MFOR$J< &%())$L,B>2 C4D8)I@'("#W%QV+#J'3+>X:&,,AQ,3Y9DM6BO(@F/ZPU9F4KONL&>=IX&"Q[S'-$D363Q/T$IC2.2Y'L+]IS!FHT*<;?1PEZ=@'\N>:Y:;QWCQN[YKGRN38!*G6PA1K&-X]&/@$/_;GK=4W' M(; )N/RX1WTOB6N#;K, M&NB3ZP-GI6;. XV6F4C$IN1/L=Q M<7B/!DFWR&J)< FMR X7&X' =P'([HV];_:'[*JJ,=\DY5>'AB52&+FY M3,9JPL=+I?<'=VY+WXQ7A9H%8\H?S$ M[S,ABCS)JZ(ZR<\[5%F&QR%&ZXU+R9#(-1[[BR:W-;[2E J[#Q*<81IEL8Q$;9F"RUT#SXWB,DQQMX8W&G(YKE+QY!\ MDV-TR-W%/8F%=HDOQE@%<1PZ!C39:0"+/&O(PV_):6FC6+);#HPCA;@RG<,P M@7M9P[:/4%:$N,DD4&K)MLFS+[')%KA]QUR!C5\!=IQ;T(>IR9S'@CTFP0#' MAZVI::!T5LD>=E@W5,E3N_ACHXG7OZRBO+QXML_)2(UAOI^$Y)_4,>&KX,/" MM1[ KUB M60='R"40H<@CQNTK4X-;KSY<*\9?HD]A\1,'=71^BX=D?J8$0&<+%EZBE"U: M"S03\A-_##"642W7*=4N;0@N"A2O(U8R-0)L(Z#L-YMK?C02$T/*WBG"#W9\ MN)4;%AP71,J.AQ1L1F[R"V:;7HXGD;MFQ'@H=?0LUGJ_@C7*01_KA& RA B# M/BX<^D^1"%B4GP,5'((M4TF,MXQ9T8X12GD^U@AM$A):31'R-#^/C%*.$3!; M+1."+0##=3Z3;.UD,2ES-#@6^\A7$'O*K(^,4KP#B5D485LK%F&%26/%K< S MC^H)#A3F17O%,D!QC5H<(3",MVJ/>3E&H*,/$\H)4P59DK*;1=&.\GYA!(8P MFH$R!LCGB><@TNPF(. M730;FQ]1(,HH X1*[T2."9/ _F#-P+U&\!12"Y1>&YL6GD9X^D3#190+7D3N MP;PA4P1(AD+*9$50RB( FJ(T;9MB='>[.[W%)CKB4Y.\V'?H=YBU)-M3^^Q#(*C+.U97?3R.W%O$0G=WAS.7>06T$V!XMGQ\]^-UY5 MM0_%(443(T.)OWMF9G7+6^CK.IO@J_J[Z4LZV^&+\0OR6SG+,4O[6^H+,7 MOPZ_&;^\OAN_J+.6P&T"( )M DXA,PTD JRS 0,AOQ^_R+ZSLT6SZ $HOR@- MT+XKOT^S+;_ L\*SV+Y8LV8.P '1SAOK8?Y+Z-(6BSZ+[TONJ^F IN ML^Z^D0(@M'6S:@+IOF\"]K[LOBH.: #ZOE"_NQ MXK)N80QG5K1%85FT6:*X>(M)7 CG;TL=( .?"L*T)L:@/TT8,6ST#1^3HE,$ MR:QWX<0%C4N'5 F0=W'&]85?CJXHV7*!%W@7/H9X:]!\M,/(1"RJ&O*= M-2R(O@7&_F"RS*M(?+X^,^LWWVYNM 6UX5 5BMY"-Q!@>'V1$I.RD69X^X+U M@KZLEHB&2=.0S5/[ B(X42I$L6#07J>C5-DF@DSQY&' Q'<;S A MIX.)@QXXY0=21J5WD0/:("JDM8\WRVDJ?ASQI"8=L8Q>2O#(C38O*UH=B,9Q M?"\%G'X)M8BV&VX#[GK5Y)[=F\-BJS)S;3-,Z*=:S7&\HA?BA+)1K"B3)6-1+Z1 M4/.V.Z'KJ79BS+K#?BR9JX1*A.5REB^#D[HZ.H,T7J!\4R1D+FW+]8!'O XO M[,VP@F_"7I7A-K:$S,%[8#/-SD&"^'KJNU 6 MQ3Q]@R:0#X3;QL>X#V*I+#C.H#B%5#3.VX*!.D:#.$KF4!7.,Z;JQE"%I'Y? MM^E1]7%81G>/^;I>2[F,2((2F[R,/9MH>[Q/WH9'H"F1YE<47H+2O5O24>P*5Y_W5#CC<*B=\[! M6B;):H:FAP+ B6)1:;HR9M7-.E7A=E;G0539J6DT%MD/ M,X5Y9@Q%.H/UQ:#.D$*H+%+)1& NGY^E<:)D:-Q5-?2G 9H1VG15W/CB:=KU;8,COO^97 MUXCD"6VXN58RYY6<[=IZC9*\,7(6"V$8?,A*[?\[YC(PJ M)+5AI$@3>\Y&$SB'X,2O(8XJY6D%.<B?^\&B@Z\3[P0\!"-AR4K*5H%"35'(9NAF(QS':# MDUS].4>-0'Y$=<&UNF!LSQ68CS+VN!N,9,NSNE-+:53WSGU[7PVLE, M)/_. ,=3-[2$5SS;M\8\![:+RT@8<,U*MI^W;X8KN%9RV8)3SWPXZ523S[K%SCS*QJLF!@SE+- MG&=BAOO.2+KTSR:%E'WK8_#/P42ESS-R.#OCSW9:L"%-HAL[]CR1M M!@ESAA9]L"'B;#BZNG+ ZZ1,3-O!,OV,6)AW^"1+76Q6>]"5[SQUC0I"^O*+5QPZ_W,D;& M&W"\5__-S%L/;WAN+X$=Q"]E+U2;O.^%/HNWB0MRB&,(RL![+%[N5>YHK<_< M, [%T,DHB3>\C'O*:RY4ZH>[AL30>D9;QR_$"(+UMBQ&)5GZ?X?T)K M7'=BRS%*/[CE.]."@K%0BMD[/[J:=*YTY*.1A5!JHLVYA(40L'=['VT1L"D4 M*Y$%:@ZZ!'LN=:3#.DNL.T=9FOZ!@8TS'2LP;U?-)WXF)DLZ/D+0F(71 TML MX,UTAB[.S%,?:_-.)8WI-_M I*L*^A?-*K'B'@SY) MIBHA@RF//I_5'SG'4G$K$_,7\V_^%U2\HKUUFZ21R!RW.=TK"AV*M\:,?JS3 M$<6,( ]IB9YJ[HAET>G 6XR]R)<]>H64Q 6D9V9CMF"VB8G/:U:)0'-(92YW MD8I^Q/ZK[,KX5'&,,5UP60M^C6=_R/)FLH2+7.-4*6;NM9TQ/XISNXC$Z\KI MBSZ*DF]JSUXW?XK,33:*],_OQT_19+L[L-AW!8GCAXJ$$,AC3(&)5E45@K\[ M3ET^?13+,(D27ES)"6@N?I:Y5[:0N!.)AX'[Q8_'1$S9AQJ,;B_0X>CK? MA=N,TE0CQSH8Z7WE?LPIU&(YQ7((S"K@B+=W.&]8!")UX%K@1_='-,_0? +1 M\Q$A 1!KB(-]6]XWBL]R".05U"EG %P)>BZ!GVLC8HT/&P^2,,;CH@8)%Y(U M%Y^]3G2E7A[23*E%KB$5&;UHACYEOSBI@F;):,#-+-*>N4FB,L9I/6AYPIN* M8L!WD!@Q1\#&..>+3+[OT<&O.7[Z=8JYK3RU.%)_,-(E@EK)3V@!3AV' ,;S MS&4#]ED\$:I'H3^<5S,?XC! M-H2<=:].(\ER+*]!T[R+./?090&P8U558A@WFP46> J_!BJB/ZM-6BC 1#'^1'WI8- M+&F>.1P_?*(F^!&<$X87\%L(3PC"4A^>LN$/IFP]>7RXRM*%-!+&RVH1@#O0 M,Y6 _'Q&8,(L.&L$5Y$6H[M9FTUFA.= MQDBBQ3\:;;=F\J2/CL"+2)-&">_2BQR5 _'2158L*W6F Z7\D$VC:']R&/#2 M2Y/NAM-G@(!<>_JE/*HE?2^U9#"GP")A$!S9TG@"'L8@E";">1L*GM3"XE*2 M("&F+TL+9QS3 I0"6Q0#TPT? C9&86W0F@P-;2-( %O2F1K8L T_X- MLU%2T\M"0"V\%7JJ4ZIFTPL6 P/=P*A3I6!*T_BNDP@0RH'3K;\M _](+#O&>JFZ M=R%)^HE3JJ%R I0QFE&B03EOH>H"2!\M PXY;U)0(_$,A-,T1&TPGD>N.;>; M#:"]TQ/3TK^<"S8?R"M,K\RBR@2OGS>F4+QOL&PHIY8S8TDY7[=;')P&DB#X M7K$%0GCADHN(]M -B/&2ORXZ'8=$OB4!DP.BA9IM(_&!1QW6!8$E71U,'32- M'1/NTQLY ).^TO.A0JS;2A-?63_GTW*C>P!(;A-8C2%('V'1+$2KTP*4-C9] M'=Z;QZDLK>>F]:AML?G*OK%!L:&7IKJ!K1C44ZV&7WJ8,AZ7K4](%YVPJS29 M9ZT^L:ZI&IPCU$:<%:VV'JRQSJDPU/VJ;9TEG%.<^JM G-FP]%_/JD>M^)EH MG">M0M0UU#VM[5\$G-&K^ILTU!.JZ%^!F(&=&JW8G-"I"YQWK4*9XZ8TU*L> M)J?@IBA&\IPBU$C4[)>SG.NP4)B)'@F:I+%!F&+41IF%G?5CQ)F7K6ZY9-0. MIVFQ7AYKU$M="9F,E[BJ09AM9E"Q9]3+J)I:69QUU,^I1-2\G"6IL:D- ML;"Q,JG)JQ>9X:H[7U/4,M3?EWVMEYF;U,:KR:@2L6]3WU^@G"!(7U^OJP.= M$:N"U,67G-3MIN&F=:W(L$*M0IG]G%'4H,/+J;&Q[4T IP"Q.U[=JJ6M\)A1 MERC4QM1;9J>L*:LN,>RIOAWJJ.71=36'H;4 M%[$6G.BH9IF%7][4$:ROJ?FHV]2]3=EQR8PIP-FNZ5K'Q MFR'5+:VCJNBPI9E&U &<$-44L4^GYI@3JJ>JD*4HJU&=EM0SU"_4?YV4IJOZWKJC"=VJNGL6B=3)S,L974'+$8U"ZK7A[/IMK0JM05 M2&2=A6)N'E*83YUY9J[4L1Z"M>PVW9QLG:2<<;%7U3.=NC1>EY]?%V#:ER.< MX)E(N![59A[QF8:<*F!B*7>8E)T-G575-9D#G%K4>9=OU>^F8-6LF1#5KJN5 MU$O5P[':@B&J(-4C8">JZ)GBF6.9E9PI9H74^34RJPB<2#U%G5"ETK"+B?J8 MC]6WU%D>D-1#K:. ^IM-'B/5ZZ:UL: >?%].U;N<,U?#IKXUL=22L=Z7#IJ& MEY.814QAG;VH *VWU%O5++' 'M293M6VA[5?#1Y#G>(SX9>ZG,&K,EXLK+35 M@D)ZG7#5AM6EL46="=4SK$;5F]42K VQ,ZQ"L R:*:>TT8R9D*D#U<[56+%O M@]&7']4 ?H_4&:T$:1G54)?ZIAS5)*U#U.#5:JV7E\JM!IJMK9:I2:])!0[[+]D3@[+R>Q$:8"K(99JR(Y'!T_X7.3E%-Y%L M'*X1+3"UU])M#RK3V!/;TND44-+RS+<<],Q,RR8,0Q]N9%G21C]F T01'3BX M2M\)>"LS"ST=)#,DKK2TADGJ MN-?AQ?TF8:"FVFH.>&C Z$JL(/[-(S7-2$ M@ZY] ^4$@R'@HHD(:P&N'%JNVXW .@P03=;%(ZZGAA6#3:9LP@+K%Z4$!I3L M/BR>YA44 >"E'9:A$MR5V, O&2:N5J%A >D80!MA2)%K&%%.I(IWC[#J%^JL M#VUO?L)MR!85&>8]XT5/9)2&80$@#28%T!SX%_9()M/18A+/=JA,FFG3=A(? M*?!Y7TBI6V SH+.D,*!?!UR?CTGG3)X3O+\O&4H3R91TJ<*G MB*]V*QL&D-86SX@#X#SZ!1-?/X=#>X"T02IVL.X:8DXA!J,< 0NH"_"?1*!@ M?X*@>JI\J@L.*YO6+RYZU7L *\]G!#R8HM.]897$2V.5R:!4T%R*(5"KM0ER M;U"V/0&D/[>DQ+_( (A/4-94ZE<9=,K6,XLYMWHO'[VPMY;0P,'B< 9HT[8R MDEQVATYO4)N! WY#9_N7;NPQ77)=?\6>>V%=<=I9;$'==^MO/6.=<] MUT=4$-=CBD#7CY4-UR[7L4P*UT:U/G-1MA:A94PE:2)PJ&?^UA9^8E0U/1'+ M;83A5Q^APKQ0E5J)G-!"UW9V%-="E8W$5$S16A>X)&XTQ#R5P7ON?1K.&@AA2$YQXHA>(V4 UX$Y9*H$MB-*2F1CYDG_$(U5^3U8 M1!$,\X_2P.QIH9N;"5%;W%R;FT]G]+S*@DH8V;F&KE\'&!B4IR1):LKU4"2; M^63&Q-$-%*1NHGT"Y#RGE0!GZ2I"ERL/*YN.L#ZJ'LHT +V4MLH"KIA3^J]Y M"&01T@'BK#\#WF0A$ *N? :FEFDN ML!9-2I806V ]H+IE2'0: [^1&!?FM9RC@R3T@Y*%D0R6Q'[8,&G20.(K^<@ MRA?"B^Z4"!TVG^%03I\.*J@++%&&UHS.*S13OT1[_A?\8!59L ./D47=AV 22F,JB :IU9 %R-H1@7YR&.#$76WT*? MH*[*FI+)#F>A/X?WDDD=^I+\T_V2!U\ U$D&\].UE1!?V3I!3@:3"-1"0X,= M=+&XU'&Q*]26EVZM)-2_U+&QR*VHK2S4@:58U(J=D*U:E[K4F9?EJ5&M(:V) MK:'8NJE5L934F=BLK;H=9ZW67_:K:JU=K5FM6-3PJO74/=3?JD)QZ=3\J^6K M;VF7V.V8-)6^V):IO-@)R%2=[JNAQTX]Q=CMMBR'O2KJ]BPV&.M^*O' M'1FJD9DAITS5UMATBI&85)<0JE"9RZH1F?JJQ:ARF<'8CJ7XU-6II]A U&ZM MG*U.I2&MZMA3IP.MZ-72U**EGMCMV)[5EYSWF?'8NZGJU/;8/=3JU=_8&:U5 MU#[5HM0SJ_+4N:J0V#G4HZ7/U/38/['OV)K8G]@+V9W8&J'I%4:.) MQ:G+2'@$$,9'8]-;9T>(A*2EHT0U1WA5LN2Q*X#ULLPMUK.=#=BS%"!['R$6 M92J8!R5)*;+X P8)XPQ;!\<$8P"8!E@": "G#';99,H=LD/+6!"TT >MD8!J0$,#AFK\B.K#?ELNFR> !>!E+, DY@KOLD Y ;RLOL!>@L; :D#\ ./"V, =P;O!#H#8R<1E**( end -joke -- Joerg Heitkoetter Systems Analysis Group University of Dortmund, Germany (joke@ls11.informatik.uni-dortmund.de). From cellular-automata-request@Think.COM Tue Mar 9 10:30:56 1993 Received: by mail.think.com; Tue, 9 Mar 93 10:31:02 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 9 Mar 93 10:30:56 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 9 Mar 93 10:30:49 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA27922; Tue, 9 Mar 93 10:28:02 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 9 Mar 1993 14:45:06 GMT From: heitkoet@lusty.informatik.uni-dortmund.de (Joerg Heitkoetter) Organization: CS Department, Dortmund University, Germany Subject: Texinfo version of "Spaceships" by David Bell Message-Id: <1niahiINNj07@fbi-news.Informatik.Uni-Dortmund.DE> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM -- Dear folks: In the next 3 articles you'll find a GNU texinfo version of David Bell's series of articles on Spaceships in Conways Game of Life, plus the recently posted addendum. Be warned: it prints out on 250pp+, and has an index ;-) All you need is a recent version of Texinfo, and either texi2dvi(1), makeinfo(1), info(1), xinfo(1) or an emacs(1) in info mode, etc. Glue the 3 parts, with news gartbage remove in one file, naming it, eg., ships.texinfo.Z.uue, then use uudecode(1), and uncompress(1) to receive the original texinfo version. Enjoy! -joke -- Joerg Heitkoetter Systems Analysis Group University of Dortmund, Germany (joke@ls11.informatik.uni-dortmund.de). From cellular-automata-request@Think.COM Tue Mar 9 10:31:59 1993 Received: by mail.think.com; Tue, 9 Mar 93 10:32:07 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 9 Mar 93 10:31:59 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 9 Mar 93 10:31:29 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA27928; Tue, 9 Mar 93 10:28:41 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 9 Mar 93 14:47:11 GMT From: heitkoet@lusty.informatik.uni-dortmund.de (Joerg Heitkoetter) Organization: CS Department, Dortmund University, Germany Subject: Subject: Texinfo version of "Spaceships" by David Bell (1/3) Message-Id: <1nialfINNj07@fbi-news.Informatik.Uni-Dortmund.DE> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM -- begin 640 ships.texinfo.Z M'YV07-*X@5.'#@@Z9? (-/,&!) Q(%JH:(%0H1N&$ELH> BBA H5<^B$D6/P MC1D0:,J$(5-&SL8Y9>B82<.FC)LP;1F33AHZ-4%,@1-F M3!F>/N> $ ABR!LW=\+D.2'U"$Z=)D$P26.F#%$Z8]"$@8-0CILR=YB> 4N& MS$:('E78) ,B;,J5+17D0(D,Y((K@?K,[ MC!L006B J -3#M>-,V^R>5-PX]ZI9F1O)"L4.AOF:&IF5V 53AXY:("A) R;+"A@!-%# %"$A>](4<;81AUE5)YA%1& M&W/,-X1Q8K0D1QCS!<$<'1NRD488+BC QD9!@@$$'"0T10=+K3HPEMCI#$' MB6_HX4(8=?@@F )%D'%4&7R9(<<;;8 0QDXMI?%47R>-9-08-4D%QQL2\D5' M0V_=,<<91]8!AP)@C($D'(REI& >+C@58 L\;LF@2"> ($8>@BGQ1DMG@(!$ M&4>ML2<=;2DP180(48B<=!':",(18<(Q'Q%E,$523FZ4=))5;1#4EE(UVN04 M"PI4X48:=K0TQU%Y0&F?@G2T48<;9,QW1$L,NL&FB:>EMB(;<\0@F5 +-IC& M&B[,FD8+9, J*ZTNL.0C$->9\1U/XM$A&!2XVKCJ@XZ":1Q"6C;$8&I*T@J" MD"&A)T9!.J4JAQC&)FDF'$Y*99("=/0DE1AOH%:307 M"&Z\,:5.QB7LZ&X+>IO&@Q%/K,!(.A7\5$NI\O5@& $N3%R^)6YW1L1RF,5M MQG-\>URX&V9*Y$$-%?R&4S4?Y"\(,R75;YCJ@4!%&5BDRU?! AG4KUDQSU$' M&W14"(+/!^\\]=;HZA5.B7D%%M$*RBT3C&W\88=?(?5[\4CA2$N'&@H@,+C5D8^.1H02VPG MH&[T&7--C&?:]]=0BVUGP&L,G$++,\==\\8W2R6NZENJ;)[3Z]H(8AKO(@2" MXD+.M+.\-NM[$N8* "QP3,O1RMO79M)Z%.U2_0:"O/0:92]Q>;@]']?Z>:V6 MU K;9%3,"E1]M5&AK]MDR2# :4TG%[N_![SPK2\#Y6EL4%98EP4UN;J"; MQ.RFD_+I+6UL.-W0 >[;LT.7+;+&;GZQC#>[<]=\#I(SN; !F-=17E^^Q?K M!J: J#7$.!)+"7!*&+HZ2*X,\_G?]!06!H"E2F76*K"'JD$ M5RGT-2B%6[.@S3HWL>%IY7,[$@R" MAC>P 8 EHI:ZT@,SL\B1+]Q)T&N,@I1*W7 C?$S*4IKR%,5(A2I6P8I6N/*H MK[AJ+&5Y21W$$$B=/.$D0A"1&U(C!ZTI 4!LR,-,>#*?B@5'7GEX7.AQ>+'L-'14D,RG2CK&.]5I#.CA9WX%0>$8T'E_.>D)7,<^S XL> $=; M/2$)D8C N:SW2"L^L"VN? E[XM?4EP;VN0]K;I,?>NAG/SG@SU&4[1]?=!A MA0U0I:N5G9#G51WED,L''"2ZZ3E)O&$2\3#X)R(OHL5 M^#BNU0F#6I6A+#9H9UP4X1=3XL#:^L25QO,YNV3?82F;S M-1%CB=*(,Y\N@P %0I(#,=_9AK.!H',L:<%-@*PW;WBHB,K2AQ+Q&4$@ MBG0=QB!$0 LZD5G92E<<&19(FH7/00 FKW/":.P&:LW]'R M&<3)F(1T9S##'O9&9N4&LV4H9GP) @BNH* B'2E)7QNI@KP#'B9KBUJ=0L,> M1) $OVU2:$\\"B/?O*%V"V0D-&E5&CH%JW$!W"!W:.!QIL/;^T15 .9\[E+SEGSO#HON=%9A[YM J 8X;^:*6 M,7!2209!PE&V)(>3'"$/;;C)JLQ&*BEHM'5N4PMS;#*?51$JO50IJ>D*>)P@ MP$&<.NG"%II^%,ZUH55ER,.34!ZV,UPXP ISNAMUTJ7Z*>B-GT.TN@38+>GL M9 PQLTG+$-27MTQ8)S/II$&J-(?F4B67%^>;S\15YO12!S@): !P*P!T&,! Y9 9EX09. MI@?]J$ /:$53HU=I(T;JD@2EQ'\5]WE.HCITR>.,S0^\X>< M)HE6%S-\(P)>D1."6&ID40:(007VLS4EI'B=I ">MS"1Z7S'P12$TA+'$19163]PN20LL2I,F2%JD9AR,!]S@VC,6&AN M,!]EX )GT!\HMW^ HS4B\HH*(P)B,!U>)P*^J7471Q-$%C\HH!9R4"[&%Q. MJ&*'=GL<:8EDEP+5.8CYH9VY]A12D00G$*@/(HLMT2I_R7MP.4%NH$EET (4 M9QQ%QD85$P*"401N@(NXVH+=T7-ZPB=^ BAT("@MZA)-"(1#\8.R :Q.)0=+ M1:QKX%2OB:Q2YH)X\"/@%F[!5FQBZ$^9YFQ"]$NPQG9]9A[=)6W5EA9K\2F@ MMDBCIIDV&4G;RJU$\6P/PFR:AJ\)M*E#XRA?DWH'6D HE:A1LJA4\B0/$C-. M83KG97^(=!6A]AQQ^D@WV1]*(T,4$UNYTJP1W"QP\>Q=TJQ1, 32* M ;AZ2XI#6Q8!9+0)E+>V!@)/\+01-F\*T&\XD:3M8C?PTR>J!7WWA[ ME3LF M^;.&]#EI,W?.M9,P^7] H0!&4%XAL9@[D7W/F#XC(2+^N2Y:$;(W2;)9R1>A M<0,PX(\B=#6M4GFC2[A1L;*.F2&#RBYF(B_^HS<1I 8?HB0 @Z='\XM8-Q($ M^@93FS!'^!NUZR@@$P8M)!6HY&8/J"Z"IJJ]Z/J,H%XVGKR^J8M:S58 Q1G)@1X MF@0*\)9.2AW*]" P(2^-0\%]H9'$$]=IN@!SSI%8^H][MV@B> ,V&A%T7$41,8"P6'"#R;&$.J\J,_ M=+:[(3V9LHG02XA,*<%RRED "HL&3!:4R(NJV7P"L8D\01V8YVBQ!7I$$HEO MZ;45B;$:K"VS8A01-((.>,(R])8P@855BVZ1J#U?T\7RHEDI.B[:L3,T'\\QH2VAL\,M2,A^Z?"G5H0!-\%*GQ[X^J[P_ M43]'6#C_<\0<"2\6EW5IDDR$*D!"[P6D)1H['(2;R/'UN<"KQDS/-DB2NV18]:SC0E"LV M%"!G5)KIA;Z>&Q97,CMB0!/74[9G1F@1)R]U5XGI+ +(=Q#*$CHU:<([#%NU MRWOWXRIH8#:+IDK=E+*]1JL$D9UOXR1 D\ZWH2X[W#+U&F[W&E!3P--+DQ8? M&UF"\;JJ=[^)X<9C2RK!(V00UGT>1XF:&6: M^%O*USEN((-'TCLH-U;%>69*,T)$AD$*D!,OQWY\D63Y[$P(<:!/?08M(,@F M=A4TLD&NR3D90@<1-ZC&/5R@A,%*$!30H M]&!@M+E*XH(NL=B2V=AM<&ZN$MF@*6&. D$UP1>*LYXHN;CX 2 BQ\UUNP1N MT]LV\ML='=IR6R.'2P6N'4867A7[=,UUFTO5.D0E/C,;8Q?^2GF.K760':23 MW5P9DL"HTR D7=E1ZKU?EMG\'6%$0DP+/L/FL[3HT;0UO,XYC"9GA@*-Z"CF M*QUU36<2I.0OOEG)23LC<9F2&[6=Y +O<4QOY>1 "W,_'D"=>M0[X4A_[18? M ^ G56X%_MB-9>-AI#69_2!@V1Q=B ?7E>D*D->*L2Y[(A4PN>:=?13ZHD8'%T&_T0:$Y[76 M:Z6:W=^TLY:KM>4H$VI2(=M64S50I*(0,^,'CNO8@[&#Q,Y%AY3*U,9BFA)# MR>JN/A4,,A?__2EJ(M18;:'Z^*1YIM1 M@N:%B^*DR+2?RG=.6R-02W8EW@3EU>X+]T<,S[?]_N_/EBHE+N(3'B#I!=K\ M*ACC_N12@:1>%+-YV"]7_MZM@@+MXGRFE2TM8&]Y:&=^=0=N0,OS)M_N7=]W MG3)A>AQ"3]\1)/#MW/( ,EHW\MF^8QQW@_/MTTXKS-"^SO/-XO/X_,Z.$C&5 M_7_U$Y GQ?0J\]!41)HC_V7:DQ X 7COD=S10^Q*8HA!8TI)O(YV)IYV/^1A M5"(XC:K (?9PWRE)$18*O21H[RA'__6\]5\JC<9F\M!W2A/T6[IU?+.Z\NRO M?1S0M(TI6_?(PS<41\\O8+73QVD*$H#:FQ(-S=98M+Y)"^^-UHD$_[BF@BJJ M8OHG=+6L[Q(Q[OF)1=A='^S^S)\8]B]^S>FU]T8HP (?N/#"47=CT=2=@)7N@-?B.ZVBKPF/K=62 MM =?$PC"J-8%AELGV?;@!-030%"*F&LP:?3#DRA\5JC MSB6@JN/0[ S"@U-2F6(J)3P)"!;\4'BR@#?C(F! !R-^%$U'LSECH&P$N!HC M%>)?HW,Y5N+(!,'1DG6XV.ZR6&5AH7V-[+=PS 90BF(+L!GEO_O3^1K?RGL! MG4%[P(KVIO047E0P8&/@!= !: ]"$*EZQWSS?,P/>9VSF)+^ZMO\\&,,;[! M]>34TY,( M M!=Z](Y'WU(400(%R2$QD.I-C)1S>\+A>/>:)-*8#U1GX# I0 M-RO /SBS*7?M5$**00%O3] AOC(P]Q!;,8-Y0V_I$4*]%C=,RPV49]QMGU % MNO<'<]W.HWN%[3CMB^$M MA?R'\(B?$"EQ\[",* "2$Z1\5+\99FZPG1D.@D"T.LD!ZF&%(T"4H+B6VEQ$ M=R),5:+Z73^"1O_VX#9<@S$/$"ZT&VAF$")YDV@43434"*30*LX&[2 27Z^A M82=.9^VP"!G8$#Z/$F6]W'$+2TJ22#JY(UM\/:*AII*>'IR%FF\E]A@&X5YV M!EG:-&C @/6PV$:(.MO70$U[8X.8/"'"BMK<&: *FR^UM#F.-##:#]59B0#Q M:RB(]'#L F+KTF2>;+3P.P"2Z3A,.XDX6*\:,H$K, 6F "V+&W6A)L#%-;+K M@*(W00%-@"[:10/V-?Z"'<@#>_%A5$,D(!C]7\8"4$2,TPF(K.9B2A,E.AET M#BUQH62F/I)/JWA7]NTQ]JF8H0-*',<#("5N+M;%U/@6 85I87H53S!6//U M!O2B:U2,?G%=!2[&N!H9WI_ #XCQ-IZUR-[C#+NBT":A>)H@0)C7:2/=\L^6HO09AVG'7_4CF,00 I( MZR AR2,K,8_J$46RD@:I(!?DB420#O)!NL>X-QXIY$WAC?,1!=1'ZLC[KN.2 MXPO],0"*2/!((FFD62B/*_) FL@6R2)?I(M\D2R2/4I)",D7Q..$Q&_2$3@\ M/QV#SNC%JH (U._,6#_5!G4.54.8 PPB0 1"&;;FBHY)HDK&@:&L8S -9206&@G M#4IMZ#.<#<70,+PA2Y(*4[*]&&#?6GF+IE)N&@XE'W>>A9R/AF-)X$B,A1P[ MB3:4:*+2*> 1Z<$#-]%).W-/C0R@$!&0)1O+K)@#(F G"BR#T"O_%A>BC/+, M( F!E7@$L 3&F"=4(7@-KZ,TB0(6[-(65E+\H:4\6?:P1,@@#ADHH/BB!S0O MCL*&0 ^;J/85)]/H+%O"?%B6Y@3$/:Y6Z2O[%7[KE"^/#?Y$TA45-MWZFCN* M,D.B% M3^)K-$QD\?]^6YE93@8!=2F^B&F,3,K4&$P6T4;XGM5"CD[FHA$!-N$JO@5! ME#MB9(B@?ZT2)>KC0%-IJYA9Z.SLR-F2-HW(G!YL(8TKH9[.-;YB: M%B!.VM**P7KV0\24/>8W.%><$?R(' Y^U 'A$MLB2^"811QF),P%BX,V\9FC M\(B>H[W@CZEH*[$4ZIH:?7$D2,RM1]X\)I2($KJB%A6Q&2(Z>4.:FP^9#?B\ M':BG& )3$5.(&*I/I$(C.1^:Q5-00! GJ0E,'C&8SJ;L!#NC94N,"?/%:5+: M)KI&FH23&##G.0>@YQS"6%>@\%"@KQ&=!(+XA")Y,GTI, >1!- MCB6LA$T4,3SHSLRB"H,A($^\8S\)CI*::!)RPM@(T]D$WQ B4ACJW> <2$JBW8BRL(FVZ!-=?J5G$]&]*6H6)RCD&J3",2#"32=*$DI1_1(,CLH0:21/)0J>D"Z6E*'2&WE(D M^2!UJ9/$I2G4A:9(82I,<2DQ3:%+DIA"R02I3']I>FRF,31&SM!I>AZ-*32U MILW4F/I29UI+M^F)I*6]U):^2& *0W_I8+&2.$IC;;I#24ESRDR["1)F:&+1 MA880K4:%(@FE!RRX!-UY/^NBN.-II#21PC4Q<25(@F<\*=5#F0FT@["3+.+< MP&Z<8U6P!&EH$+0'[7-D_70*$*^$^@86*IJ<8691&ZK.I8ER9IJ(V&='8046 M&L*W)AE+ I1BS^A,$E18X3='PDSS(NBR58A QT-*HR(!&6B\ZJ2G7@Y<*W7$3L 3*?(4^;@6YF9X QIE@\HF+6,F%> M,KCV2ZK0;J;'[[D?>_6V=E8)Y%>S(K%K'L U,7@3@1J@R@=3FD1+0ET&1$MJ M5G&K &-X0B"\ BW!\ 1,3Y,;EIQUIVZA280LEP]U&$5A0?$ .11A6MBP74C&O@5\>&.]SGS ML ("EVE8HR1A38]V]:LH@)5&AGHB)&$I"46G,=*9,LAQ^DQWJ8H\D.P1FTK) M9'IE6^@NG;+?-,J.TW-:(OT5P,JK&-51_,M$>36 I^L<3)'()(D(B(5A&.J9 MU"H_9G"2A+.H,.B%4>)?-&%[LP?BIUV'=O0/>F!PIDF O!](>SBR:K MB-[%4EJ==J$2 MDL2^:)^;I(IE124; T!LBQ.VJ;9QZ5K_$#X#@P)0-T<6HY)7=A4Z@$R=-2 H MM\@FU5:A:.>%!U1U">1K)-Q 9R1W8LQ 'B9FT: ,: BELMA>/;6\0><:P>;Q MC+Z"]]D\N.$MS,KF:^8,F:MG26ZJS >KEPH MD'-UK!U9N>UUNZ93U',M$>\HFCM6)^(8/?IY<5&MSFV+CS EL 4D(1"X5,^D M@Y67[LW=0W(<-.,[J["M0EDRRW8I!^8)&9)+,>2WP@23$7051NAM(J0W8NS$ M)#9KCX,ZW9),HKKD4Y10Q-A*V7MG+LUM) 6I:V-(PJ*%I'2OQ;:YG,*AUE>8 M"6B=%\H,7FTA$E*#OO!1-, &P 8D.2Q@##K KY8[3MDC:T&R[))7D>O2V!G++ M\E)LNV[#[#(]H5EV!JO0)&E->S +_L'P-MS"X%S:(-5M#86/"D N=J6ABF! M \55+=^7YZ+<,YL3KFYM([4Y8>,2QY%K"64 OY_?X-F_JB7U" VC'K=F8(5 MD38UOVL6>FZ&"%1PB9*VW9ZQ?^':PKF\;):&U=VMNA/P[LMA?Y^R95S8+LQ^ MT5YTY;W^@?E&X ^<9 GQ"9:V ?+)FM!F^F[1;3D]MU0VG$))%DI,6W P)<+* M%)QBXE"<;>5M#3ZFV=3:@MD5V8EQ,)/DQ.HV!ZO;32Q,L2PY-<4TM!1K6U9\ MBI7I)[;!IK@5!V-A_(N#L0P-PL/8$X_B<3N+AS&5M+PU=6)]# MRF 5A@3N@OP) RO9QQ?EQE-O^T. M9L;$N)P>8W&JC*EL,QZF2!G< M,;S(N=,KV%D4E2EQ[A:*R$T6XV5KOI!4>V MQ9M@FM5,I@61_#/^H_2&S #(@E')GF MZQ*B%P![$H;A3HP#FQ,?S0W_@] @V?-%87HI+3)$NCHR;^$34<[JHR_F/ZV1 MOR@I*]V:97,18LD 1T*B\XW2:/=5ROL;PYQA4 M[\N_F4,=E8WHH)H2L!F)XDKK;1% :[ MX"&,(&NS#14,IN(WK!]X"B#6%M19NG2X4%H=NJPX]I@ 'LAE0 S0CG68G5;![PRT] M01.!.^G.'&Y16!0,*-'J14P-RX<\XZK8689=5;RK^K!6RHFH!B^QGUI M:*A.2PH%%G:DGKS)M]_BU2Y]4M/+P])3V_B@&J1Z=+N>A%4P9BBHPU:&&S!K M&-[3!B"YPD)PIRK1P7I"_7T#3#C0R1U\Q#?M&>> :6X$T=AJFX8<=D(5_9M[ MM_>8Y+1MJT.0$Y5>@-T@E(E&\ZU2%SBWB]B:4L_,U78KPM"(C2RC MXH;U,O*#UU3N.#".)21X'8U_.<=&'"?CTD,DSP3FH]9: 0@F/"N2B9=ZB3 MV>TH=!-J$I9NI('&#_0GIZ#>':X2T>=H7LV"^)MO66-BMJ8!$_9KPXI8,8II MS) \$N3)PSJF3'1NKYT"')QSQ,T9BX%)\G%0CGD0P#0$@OH<#PO+V9'WD4/B M$*#4A7$ #GC$L'HGJV!*9B!9LS.>MS^<&5?B( Z5[2UGUL5$'"HG\5IZFH=Q M-7762!B_#5UN2<#3F55%X/-3.,%MKB5Y-AFX_'PNT$O EIMZ+A,.X)T+&.L3 MIHP:-I@>#O Q5*9O0MG;VK"ES W,$R%A,5@O! MSKB,NW/369&WH3G^UB!9'=HPT+!:-@0*)X%#$TC%Y"OP;Q@[/=CK8L:Y9DHQ MH#X(!Y%CRQUO%9@W,K#?&M8&=J)T/CU)XK&*%B3% MID,)U4U2EK)*@LZ9P][0MY#[5^5313^^$A?-4GE6,0Y VPQ&<&Q7*9F-%*0?^@6I4*V7?(NB![8@V@"8H5EP9Z)J[%ZG M&$<#.**.'[E"LF&L(B!:C4\ UT"KXF4D*8,I?]1Y%^H4X)>/GQDE<+U0UZ*9 M8V2G;\0,@6L6N'>S@%H6AX[(LUC-DALX7P!.?->'D1BCX>E([1 !?O])87=/ MOS59:N8!) V-GM$R#LB)T\(G;8G"01.PG8I8M=,:_F;AK9PVQDGZ:274I6 M=F>ZV1FSMF6/G=VR%_8K^]@/^V@?MZ<=&4-)TQ[9%?MCKZ6.O;"[]MC^VCF[ M8S^FJ9W*QG;<7MMM>VA?D;E=M(=VT-[;?7MNU^S%7;=_]M^.0H.[95_NN[T5 MTW;G/MNCNW&_[9 =NVM;YXX>K3N4Y.[=7;NS6^[^;8F[=P?&T#VYLW824-UA M,VLGQ>(]G#+W]I[>I?MB-^^]G;YWV<.^B\NM$5>/M[V7%G88JMF).+NB]?[47ZWNA2_+W:CC&7-NX77LK/8M%?XYA[< MES4GEO#OG84R=Q5I32U\BJ?%^AVXLV+B'DQCO'OO[Z#]VBK(ZE[:-S&33.[- MV,;[9 D/W76[8T^AE5C$&_G[WFV5?';_[1*>NA,&(._D^WMJ=\$E7L/[^/!N MV$G\96?%KOVSKW<@S^6WNWBW[>[]O-OB*;_:M7Q6AL%77LW/8AZ/V"MQF&_R M8W[&B_;,?MX!?&]GD'W>S]=BR8[@I7R=C\SX/;O[8EZ[40^T:?F\%[:SSN=-_33';6'^B#^$I/*O@_[ M6[_HO[ML3_8J?ME;]U\_ZJ^[L"?LL'ZU)W8H'HWQ&V#O=2J[YA3:DX#)%YK' MA#FAAE5^2FW8$YA@XA[7DP5DZXRJX=]@4:-K32NE;"2MZ+CNR2M&0S*M(@>L M<^ 0 S"Z_/!%3P*:M/MZ'](CMW<36^A!8>TYASDRT<5M^/6E7;2M^^7(PMD M[+I.M(FF6E_V;E+"DMY\W7BX6B70'OK8Q>.N;R9!PB)(Y:$2:A=A-]8<^VHE M$ U_R04D>QD$+]R]7*6@PC%<0DU!_9KQ)"(CG;YI*[4%TK$_3-ZL90-CXU-Z M8900LI^?W4Q;U;,)' >- *<,C*$U,2CXF0L6G( ]?3GOOON;%GGI[*_UQ3 MHJ54#^;CT?H$:&0D%6M>K4O2PZ-!EU?,ZE\KB/68\3*F48+O6!,%S4;L4,M8 MP^B&V#?\4G\/&LY!=40UG5\JTQ=,/('4KW'TKOZ6ZPQ[L.A%$&<;4C&V'=*G ML%#I&3#OS_9WPR);$ M-#%3_[JL7,$.>-QO=\ M'0=8759@W8PHJ$E(5;^I! ,:EB#Q3"YCSIBQ !?V8 X M($%G\4TS""!"Q_"8@"C@'4CVK8 Z50OX84Q(1 !N( 'Z@&E!6Q0$WD0:!6ZP M*L0L?'%E' "75@%\R!/$56^E== M$Z+T#>>:U\'&:$^\ V#F11@E7HR[4\_982*8+\0I+34I'Y&@:=D$9A2=(4GE M,U]: :C@ 9.&3C #N #L5WP1"K.)& M;'2!#=0F[EP_D$F P$@80,(#57 "A4,IAJ/ ''A/K56EL!=P%3F;9"4,WA^W M172S^009Q@_"=!(X ?-!+K@A[((2QD5"WIR$]]Q%F'9(!>&>\Q+P5#1'A 7W/\DV*<;(,@3N-N*)&XB=B#G%CAIX[>!= MW,ET\1LH E45;<3*4' X(BE*(D(<4-)$/ 0A,1'B'*] 2P'H5E@IPU$EE - M\$]I)I"@8-+97'$IS"22OTB%9=?N5-4I #8 [W #M Q4!25U6)0%+4F30PNZ M"M"'?S.;:'03847(&=8."\T UK718_G+H70DN'^/1EEH79TF5,L:YBVQ3#P1 MC78:,C=2SN%$!9X$GR&H-&J=:I817:8NA'L-W?1%M%2&_$()@"G[23 !Q%!Y#&H+H%L6%O,-V@QN>"9%#&%14 M93JMPD6"%K(.7*). )U,!V+ PW0'0HEW $8VX3Q@B"*TEIOY?H02[6' ;(7I MA?;0QI $A(>6H?P%@J?< OA_T$'"6QQ5>7%_6!708;Q(?C=<96 LHC1"(IH M*JH>>)21A%\4?FH79CA;V7*^SI-PZ"@IP-Q;]K'4"#/!&$#Y%4+'DA$S+ %/ MV1D#]=+U"7H-%X(38%1NW\#R4Y&*SIWV(H M1_-$6T,23\;#N7?:5+(6Y/%2W-0VY9BQ>,]4BQ24V8L]W+J5X4UE[F)5UBYN M9JI9+E7$[7BNF(D7,*)( .,*Q2]B9:!8$::4U8N9V&HV+RYK\B*\:)4A8^TB MPWCB;643TCY$)XH1L>'+9@FF(5#1X,? '"BHHF)PT!E?CDG2-J4<&#@!422> ME'S^S:(1LM5LOYRM0^[M9@79R8';=(HS7+E8^1?< >Z2,A@U4A]C$^OXVFI!,*.%W,D5H/^"\_8%L)I M?6-!Q%6X4X1.%_@8_6.R8NC1SYP):F.=.'0Q/4,*[C?1E8V-S!V0@(4H,J.F MB#8!;?X,>%(TRHQ C+M 8OE,5\)]EC6T13/,2D6_E %>HVISO9D%4*/I:-5A M/\:!9-/9C$QHA'W6TST:I\%;4RX<;2)4^;3NY8.O9T8<$.N+(U,+0' M422(05FLS180!'0!K$WU&#T& 2< ]6@]GAE;@!"@/5:/W6/VN#V" %O $/ ] M@H]#0/;8XIE'VV,M-CXV#>,C" _;H_S8_R(!62,3T#[J)GICQA+]:@B\8^L M1/M(,();_2-KL]H%D-:CE"1 LH\)9 JU0&YF,)3^&$$VD 5DZG8B;8_!% ;I ME&U3$J0MA4&R1P_D!WE!)I LU,2(0/J/Y13_N$!6D-+4"ME"M4@?Y+OU/L:/ M\N/XR(L]D"_4:B9 ?F(T9 \Y0]*0]V.^^"))D/KB:,8_CF8+8_YH/<)BEEE5 M!D#F8EL> GF68_U8P]Y/PH&Y",1<#YRCT2 ^#@^;@%%P!;)/18!7N3VN 48 M 6+D&:D^GAE59/781KJ1/N0;R4;:C[C4"GE$,I#^(PMU1#Z0DUD(N41>61VD M$HE"@I D)(ST(&F0)Z0!N4+MD.=1#,E"$HR'9"')0EY9CR0KQD@BDE&2(&E M2GB.9")I08Z0>20>N4EJC';D$NE!%I*-Y ])/Y)'-:3]:$/>D*8DBL1*^I! MI!7Y(T2/1X 8R3T> 6MD*VE+]G 'TAWY) 63IF2-!YD]DI+9,;E#;I!)4@?I M+LY01Z2$ATU)D<,4-/E'PEL.8S/Y1R)Y\^(DF4Q.D-6CN'4O>I*AV4_V/UZ3 M!*,O"41RC)PCXR@[]@5)$#-";#D?KM+;J%S(,P^49C(PM 7,XISX +D$6B"> MLB1 :!)#7.9>@&#&B0O0(<" )X!C- 7@7<>6J_1HQ%7$C!8$^YPW L1.LC0> M?DU.U /7!& $B]#XY/Q3#P>IL#RM0H%0PB-2ZC6Y8"$7.W(5CQ!50!)^$UO) MTR%3ID.1 =3A_0$1 X[9:#KZ!W5"G>A1NA1V!^U0-::(.E/Q=)L]!>4#H#;, M_$?NI/R1Z2".8 $*\U+B9V_9HZ$P[5,7C^&0\& ^PT M%DE-]=GQB)\1)S)&$V%1:CK7P:>6:OU\+@)/0%*.*28EJX528C]=I9;T[@R# M4:7I@#TR%MAC"X"Q6#Q0HF9Y0V 7#!=X6-=%$'EE$X3R)6(.#>;QPX@)(M&/ M,7^ ;IO.3[A[&4]K)58YLIP++%IK ,JQ,VOCU0*E 8\SQ+&05+&![UB EKDH M&SX&*<-[D1A-D5BDE^Q57>/F9!/VEO;'L'A$%!UB$=3F*K26I42KTP+N##81 MSZ ?K@Z$ I* /CT=S8)>9B/4E*2CVKA3:FP*0H_X/?$_^)\S\:7-E:'$3G0" M8 %U KORE[0%14>=F%?^;7:A&$0L4DYB2Q3(7YX-[R5RLY.TEN<-RB%=\@S( M):#8GWU_F\G U6BI-WT#]R:'16D-@J(S8!:8W,F+4,4\&D*E(_$9&EW^(4_) MFJB5*V8_TV):-!)E;$'> %I-#GGY##DBLF7+<@-9<,+C',5V^5%^4[:D^.Q6 M7"$PU%G:']J'?KDK"%D!V"-D!-0)(647%A =:RN8_&A,368+'IDY9@*3]Z)C MEF:BF6PD.VFHE45 I@G3/.)T5*'Q *BECA''ZM@Z7C6RR939NJAN@>)J\GRP MCMHEG[DGZHY8)7DE!L9L72+CH+.L5TFF "I1G _+1QR)-R16A^C:V+ M-+9IDDGW91D@-<&&ZH;A@#WREMGEU_AA4GVD9@NP\X26+0--!P32D_?'=.-H MR74%CALQ%EHIP@YU97J00/?5\.A Q8U2E>,W*QXHWR' @.P8,3G.?J8PR N2 MSV_%@&V#'Z7RE6RZ$=CB Q/K/)N1R=[@PXP$SZ,)Q=JH&ZQ-^LC:% &NYIE! M1K(V6R9K FXG?L(V QX'B9.Y;G^;=,#*U M?Y'58'(U-BI312(6!+0 4I7>MM15#3W=X]<9I(S>1/&%O1 B=TT3!HT5<"Z- M6^;)%863H@('$?&<;1L1$!P EG M>9D6$ DC);D^HG>4Y(67 M3+9YG*>_J(J=8D1>$8=X*HRCY\7HDVE3DR>E-S"6GH6G)?8PVE+XH@^W@Q5E M%B/I67MJ9I4G+^9F3@%O6\SE6;DSL47K\2 @2YIB0&:>'0Z#26N9QJ%%_(+7 M]G#+4YO)U%BZ8ZD;YJ2Z H@#V!F(F;LJ1'B<-B8H991FH!KKE M99(N5 <:/])B+MAL)H*^DJK=@@=+GJ!Y9+DUF?52HB0+&IK!4%P6)R:#AI-_ M)WJD3MZ@F.0NQ8/ZD$.<>O2#]I"VYRPYA+Z2&9X0>H2BH&"6$;J$AI)7F1/Z MA)X96YX2.H6^CVXFQ5?0,8"<#C2T%:*7@25BQ9A@5$AG.V,.O8;#4@?SBTA, ML&)(]6C("LJ$:L@UD2@&#-,%%L!C\$QBM6-Y27:#>-4:-)L91G$=GH89.UYR\FF@EE3-)09HFU>:-8 M$T>*J7;!GI15B^:@&^2$1^C=GIB=)O9YLJ(').39,*JB)60IQB"9HML6$C>; M(5/2:"JJC+:BG^B@=TMQ>Q-2$. 07@=AP1301"PIZ%L!2*J!BCJ4%V,4'0=O MQO@!4^57&-59"'7-0*/Q@]F&3OXAJTPW)D$R$I]G9P#\G4@DH3P&UYE?GT. M"T:MD3 UJI91VN7#[)E@ F@AG;:3?")?OH&M"/)D?.%OO5CM*(81! M^A[0G:\4WIF8+7&[&"HFE.JBRU@O:I229IWHI@=Z3GBFZ)LW0(ZB,.@HJIC- MH@3D4_K92:6"YRJ&C/VBCR=C!HU:H]T4HM>4YE*H* S:E!ZEQ9A1.I5=8IA8 M6]KLN:*C&8J7@@*E0IPPRN#1I:W8)Z:7XJ6/&2_ZW_&EJ!E@NL1U9KRG8"IO M'6.>J&L&F!*F5:EANHO*9G*I)N:87HQCZ5PZF7:E2>A9.IDRGE$I*.:8EG?^ MG6)*Q(&FG>EE&GI>I:9I-AJ4IJ:M!#<*M &D<)ENA7V25M;EAN'3! QT@-/8 MN0A7("/;2!.,!)U3A\,U64UGSUSW.T 0?B@9I%-%31[=SL.Y[22S J%9?M0$ MH8/7$I/6?; IDE)]9D*A55IPT3PG#('$H)L>3MSG2X;]E2Y^SI39=6(L:H5\ M:0P*I&C$5[?ZW$,$2[2HMYDO!-B5^, @I"F+_K"0HD0ECJ,D,4Q>)8O5T1.H M&H-(=13^4 688OR@/2 OI0NU.90 I*W+?X!4 6K!F=2Q74*H;Q ZRH4L-7J# M@SK>J"DE'./2NIQD(YF)*AF5(%EC@ +6/5<>1Q4"5/ER$V 6-("1"ME'ME'R MR"(,Q)D&!+8$R4[-<15!!,2!%9ABC#A[>\Y:0E7^<6?/%.CM1#HO M1Q_*(4I]):K6Y%C!!?8?S*,KB2?G@K%%R!DHEH?:TV,4B&S JH5[K"_(RQ9V MGQ(1SE>&5H]IC0H030-^_8@V)IFZ)" OT,.^P# 13503 1+N84[,'^6XI,4, M#>G-HLZ\-"?!&Q6G\45X9IWSG>6%O%KC!;[E#JI3>E(+/0QG:A[&00P5H80, M$J#!)/Q*9[.GJBDQG?C5W'!\]86C,*A&-&5C-:+?F"&0H=,9:BPTIZJAD:56 M6G(:AQ.C-(CR3/$&U>!1" %.:C0PH(L/NV9Z.(YQ)]#2Z)@P;AB)L\.8JI5- MJ;I:;0@Q"\P1OP5 K,==LO-(IQ%$5;+KK'4 $DMWY, $M,PVF 1B-P'% _1J@$%L;)AB&LJP>Q$DHQ#V"J 4'080!)"?;&&25?"I?M" M*^2'7\M[HE8ZJQFG9>FGR0\#0YB6"Z4,Z66,-:!]#3'I3,J I4IU@>W1#7TP MUQH;$,,,0"W1M.IK%G 2Z_2@NK"KE WNF+%&$$^$#1 'W0 [C["0PQV):<,P M=[M%:2"K!Z&N*1SLR,M%YU!\R-(\^D/L,/-!Y,%5-*C*D^% 29$Q_ Q(9V(8 M?KQ:]SE/51WF$S\'KL4L16J1D"H94DZ,.6,*(26[2)ZB%G =6<> ICQV*#_@ MAU(7X@3S0:%"*5(1"(W6UW*0@L!'03D\7"8QD3J(2-2A#N &$:;"=)@KTB/\ M>3$LP^"UZ["5"D;!M+B**'["+H.G>#/@#$FP L5EGB)/PV)4K=C#TA2)T#RO M9?PC)F@-R(MQFE*,3WZC2KR[IP./'$30BWXRZ8"I-2X(2 M.%2$08(<:ZF>CDP9PLA*/'D3@!DP\Z4ZEB1$D4J28@8VP/"%H>TD:6%KN= 1 M# :#P^9?=3C6:H8Q !4J@!SGQ5).F811YY%GR:SIC/^*:+(C^$W9N636F'6C M-^&537]UDY#)N5URRY'2$]B8'@HL3+&/_G\NV?572.&(*N$"RX?0"_,";W E MU 0OBGK*DZ)@/NDD1I<684N<#!;&DJ(_G%7JC)FBNBCHJ7K*6TC>&KN)LF9I M[)NGFJ)BXF12BHVZL:)H*'K&1J%V[%V*QUZEYQ91:GMVI:CI8SKBY:)]K!_; M>P*CAJQ4VI@EI97I-:J4!J9-GFEFQRJFW)9H>IIBDWUI?Y>,.:.:[, 8>7:R M]%8HNS &IBZ8I I+=N88K*C)RM[X0VFJ2Z!'WS,:R?.DR2\T. MH\)L+?O)9F6YK"Y+EXZ321PX.YI"9L:LN_67WK*#;#;KRCJS3.0UZWAR9J[I M\-/ D[@)0^Q(-P])TU,=-MX$S=0IZENE 6&AHL0(81.GT*_ MT5\%;5I-%"L2,+!%K.>15_)1B^,-N]=T3_7-20&;KEUW0R12 \FFWJF%MB3< MIN(I&?1X='QEZ$Z4P>X&>A0BPH Z"C@ 7S-QY-1KHP6O1$/P*>?=M,IK?KI[-;!5*R%9X-&A_V\9NLMKHPQB,!:'_[6HJR1:X M.> ^N)]O@AJ4&[B:*R+*QZ"P=F^$:=L0L5NJ:\9V\K#.JR'ZBRJPN MAN!2LI/L@KO.XK'=K.Y9FKZR*>YC6LY6D^XRR%*\VZ MGMOL-$O*8K.-;#EKS0:Y.6Z1F^22GCTN8X?DCK*D;(?WXPJ,IFSN"7BYKUHC N(YM-Q;.XF44Z-Z85"> 6^G\P$C4K7X:^ M)3'A*=J@'CXC65<906#1/65!3+!@X9F <(HRZV[]27(T+\(H((Y#@:*A/B M&M4C&"I=^^RY=+Q,JQZIHNLZ'/^K'Z;"[+0^[ZQQP M@4,>U6>BL S?&"-]&G/AS6H(7)X4C>Y8D8@>B\[J W9P6$8@PB^"D6U8-FN MBIL^8#G#C94DYDTMJ7EJ)TR[*PWW8IBABRE8WEG?LJ8P7G\+E"*E[*YJM]\& M<0$N:SJ6SKNXV&R&[UJX#-Z^V^P%LN[N@>O'^KM":2,KF)ZX!"^$N^#BI?IN MP"OP KR&:1**XAJS8&ELQLV6L5KIF%O.>/$BO7OB M1K,XKF)Z\D:SYJPFN_+:LM7D'OO&6KP@+X-K\U*F,2[+V\ZZN$Y<6TIXBK@8 M;E'ZBV6,%FZ+^\Z&N>FLR+N:GK)O*<8;X=F>1N]E!L;ZL5@N+L9XAGC5K"JV MERZY46XS]O*ZLV IF"OC_KN+:3DIBI:]6JZ#^\T*D8.>V N7+J4R;\=[Q^:[ M%VYCZO1NN!)OW%OF@J*XV)*;F1F]5>\B._>"6R$NORN45KF4&-4[XJJX&"XT M>_@FOEQO@OOU*KV"+]:K\+*S .ZBA_@&O1QNY)O@*KB4[X2;C'J^HB_<&\XZ MO'GODUO&DKZ?;[[KSA)QH6_EV_B6N!XO,EO[LK[X[M>+XAZXNF^$R\;&O@EO MU$O@TKNJ[Q@[Y'ZQ8F["Z^2&8O&L@!@X!+7-KC)!7MVDHH5$A]TBB=JMFZ'? M&+JASZ2H.P%B\6V?D-YVMEH#./B(< Y'@DDQM+FQJ_2*V MLNXR%]0J5F\*&EKKZJ_S!C^EZI*VXR^%VC=PI[M5"BPTO(84ZIZ4E6PN8MJY M U*>! ,P31 %6AW&1K]:"GT1"PUY<\YI0RI*_7L34+NAAV'EHLZG0HJ=@*=P M.TX G$ %_R+.X7;JJX)U0@JI"!R<.4Y ;BMI3@5%2,V3VU 7O\]\^EL,A;DN M$BBQ=2*[CA]62)W UZW_:0$3P,*/=\L7= 9=L*%;[:)_H1P=3!,\)>TM?7LD M.:9N:<&[^\*^TV@E7/1:^H#!KAN#VOL/OS'N),7BPL.P+^6JCN/"42_RZPK3PXNO[&KZ%[.#[ M"=^]P?#HNPFOOOY=*.SY[K>I;S-<\3ZR9^R+"_).PUYN'.O+;J6C+\>[]][" MV+#=Z_4>OQJNZ>OCBL,;+E0*X)ZESW#-V^"FPN$PR>L.6[Q!JP]"P)#S[QL/\\#"\\W;"9JXO; N+N:]P+YSC-G%>;D',"Q_$D.R2RPX' M878I)I;)JL/FL)A7$\&LF#/^^9V\Q'/+6HL*O M&MOY6L3,I.;;"H/$P&C*6Q+'N_'B.AO[&J8\;C],$]=@8>].#.-*N8R>3XQX M;KUN+Y>KX$+$,R],3.0^O1>QF,>6IJ4U[I'[#E.YG2]3FN0RO9+P-:P59[QC M;M*KE6[%4VD^+!!3PQ^O-+S.7KWG<"F;#I>F$K'6&\J*PAMQUVN97F8SL3%L MR%+$=;'..Q>K9C.N0CP+^[UFK]X;$B_%M&@M#/,&Q9!>7]H7&\1_,2M,YM+% MB-YD]Q C96"N*1R:=KAZ,>SQ!J$/,3OL&Z_$S+%*;!R_NW'Q9KPH9[^+#9^]TK.,UQ=V4 M=@P0$[GM43R+UVQOPV'>A]))M*7J\_-$ $'H1SE(OT!H((,_TCE5*R^;H:$N M397!KN]@:LFMQ&479V)$-S]#V; [I)B;4%.KF5@M#@?&H-Z\@$U.C]91PL>Q M!0HP$A@QL5H)X,PD6#_&M.ET)K$E3UX+8#"@7(C+B)%VH2_$,3@@>,'E+LAJ MH?48[B_6<.FZ.9-M R$5T !\W?KZEATJ\XYS5 NJ!1:7G!$X6;8-ZS_*@(9[ M7\->Z24R'JRN:4L*;HF^:=+"W#((5,&"V>1$5R;MKBML"C#8B4)A6T(1L&D= M5X)$(CL&%A$V B( JCSD ";)+9DW]OF!MXGPA! '&POQ \-T)I/ IFUGFY.A MNUTLLO8="\03,52<9RF\)V.FW+$3W&IS!2OQ"AQOPOT5L>7,)1;F.*BK?*F]RKSQ)OR7%P;C\5K M,>P9&&O&)*],S/N*HC5HSYL==[DJ+V-\>VK$^C#KV?B"Q*QGL&P9;[+=K%\L M^:[*%3%H"BI/=IDL+6P)N[$^[Q"7]J+%@[&MS!)#I4\Q&8L8M\M\K*Q,&\O+ MF+*?//6:RM>RMI4M"\3E<%&,+@>^V[# +/AZQJKI8PP.T\NF63Q;!4R*0P.+ M@41T$C"J_C<)BC.N:R_SS0 SE)K+LL6T5M.$2P,0QH?^5R7*'ZL\LVL>NCHV M?;Z.#!+P($7C:K^4%?%I8%!2L+R-"-?%O0=%Y'L=(.YG>#W!Z,O0.3)T:?G1 MHL.@,9^(<.5WUES)$DCBR+WK)S=0(*F_)S918$T3H[ MD-XSA3MX^G>>\RA:/G]VJZPN]3=7SIHD%!K,[LN3G>,<@@;/%6XKNCC#D,%S MPQ@X6\[2J"69/S^C>W/[W#=[LL,SZMS'%M!#9/[,S0+/U*0PA4#'4/'LRY5\ MB6HF3!%L1<6FH.YW^HQ MQOLSIOPLS\;\F=XK1CKGD%EI M8@H4AWB0Y.Q\.D?&D3&.NXR2H%(N4 R#YKZ5Z8MK2V?$NG3IB>01>=WD,_K, M1L1=7O5NDK#3I+II$9PJA*8XR:XD'_3Y1_7M-PT5"YTTJSQ==':* MT'6J"<:8W))DE&=2Z4)@)3%I(7S1$IA"![M*J2' MN^&B^4+$NNE".P4^D*0)]1!=E8@H+DRD^2RZH;$%19D%WUY)5>ZEL,)4+S*Q MZHZ&05BA':SUM)14 <-2UYP*>D .+<*.3 )5^V#79I\R6U(I,YM7SZ?.)A0% MNXV3[YC_,5:*L("07HT=24&GUL>QT947VG-\'1(,1_-A.J"V<):VP!*,9VYP M:UMY7 <+IO8P9UHJUUB:\SQ:(#K)F?0@.LDK=1BT-C/">/+;W).]L0+TY9SX MRLN0W@/];OV]"A("/?1VHLZS NW#D::]U/!<.5>>KNSZG PCO?SRW?P]X[QW M*=W\%5/6DIUEO?P:C.(4.(E.(L^MIR-+3NK54>ZG;%G+HEJ9E2L\(Z%9,>BL M3(G.F9WO"3'BS3TH+NQE#;+7LS),E)VSRK--W$3.S89U7JHP9\^8G8YG0J[6 MKK-NS4HO8\_S+MN,:K/S\PH93=.+OC#GW%H7C$'I:L[1W#3V7IJLL]#S0SRD[GL$RS&VUUP*:F&@G13FPB$G-MLT6C"0K MGX#IPJ9?="_8.10+$42JRH"%T>G%TV?>3)UOYW%+2/L$0O1VQ5C\BN,ML5D? MFVSAKA-[(TJ@0W0CG>[^I)FT/ZR*8L;%\3:<@A:EF[1EG#Z+6Z TC9L+_\7N M%J/LX\;2@F>!&^!.SX2>+_M+/\:XIV Z9?]WN">4;2[SMY=U/%SO3M86,1I; M39_72Z_B65QWT]3H4=Q-9V6':G"$8E788%IA B9 < M,A.:'$],S3R N*I1@[;ZE5E.(TOE@WF+++L&@O3.C:GS&YQ>+9H M*OW?)MNS+/S,S4*CY++66_12TZ7H8KU>3\N^\V?8QZI5:VT.9M2SU4MM.,;1=+Q_92W;?B8U.67+IW[OX.MLD;Z*\ M&C._^%:9-2!X#B!51TE7C2SC3*RP!1LQCP:M#0*B /C+A#.(Q"YX0BQ#)B<, M/# !0L1,U0BV;LM8[-DPSV""H-VCGD/U=P*;W&OU31$96I6Z=M6Z,W!_*$ ; MU0*8W._!N5MWYLEWM4N\5TO<@RQF1E@7I9S8_@SU3EE],M3+W]K%^'76?7@^ MVZ!OF@U=R\HY\3:-&A.CJ+2_+79#OI8RVVU-O]MZ7K/LE7K9]"+=3?6*VZST M=!WBZMU;MX'-]M[=D)ZQC&:OTE$I,=T0"\M/:6?-X1+(A M?%L/\E;W#3EJ'7 E]EUQGPBKLKPA6@^H6V*NP-=EQ#:[D$E"5ZQ+LYP> M@TF7T-<:EO9'0M,0V+,_\M3R=#()$T(L4J7Z)VKPLPCM]CI?]9O\!A?)8M__ MZB6G.YI.F!S1!C< *A02KE8M_O<*;2EP-NFEB8G"C#921VN@M>RL::H"D 4D M&FV,VF-3OPSEH*,=(I#?J ?\AX #8*6J/$7N? PE1M"M;ZP&U9@(J]&VKN0, M'R3#B)J_%:WIL>>)T:+[Z>6"J6]C;*Z.QC[(,/RE-X4UHN[YX. MKKC,+8N>:K8W3>(.UN!PN[5YGI[1=G!,7DMVA6,+#W70:6Y;V8AVQ[PW&13UOWUV?V&K^$ =ISMAO_A M7?$>;FPGXL"RO26(F]G:-IG-6&OB0]X9GC"'UG&VJ5PNKZ+OM<.MS7*FF3-( M3'&/LI_X=GPP)\QS;+H%6 _$HO<[6Y8:WG-O%,Y>>^)Z.&4\&5OAF7A@6O%N MG@+WR*MUM[*4[+V+B2NCTG@:_HQCIFPX+KW&+N.IIQ/NRNK;5_B(NX/#X=$X M#ZXH5[[V8@1M3[F@AQ:EJZ6W2LXYE8U+UM2/B MA."4T[D!3N-,0-@L-PM668V_,B65UID3%H36U)!UZ0NOCSR= MD3=!4MW?0-*U02H+>94X$"*?BIPU=JB5ZM4!6V?1/=RB?.)GBB2BGQN-8[P9 MJY;-G?-AND-E4$1QT"M0H'3NRBYR:H(D ?XA* M,TJ@ 79*7CD)C18'N>WSP#B=<;12:9*-$QMYB?-)F.4V0N4 7Z$'"/D#-F'C M*#(5YH8>R"!-R@%>7[Z30RP[5 Z!C**4)#1F*O8L!.1 .\@*9-YW[,E5.;U'/K1$Q2UD&$=)>R>!-2OSEK MH>0%P0R.-E$^34U0?3CYV48W_>*6#5U#[$?),DO:)\$G2 PJ82O!1^:/:$+<;*T)>NDK[S*-&D<,=[HUK2/'@H3Z0ASZSMZ MR]TA.I8.C#;I//J3/F^5TCLZF$YVB^G&K(N.H[OG(S&][>%ZLVOZ(YND!\M= M.B;]IJ?$+?&1+N,&Z84X9'RHC]*#[(.>&7_I2OJ\57IOHJ=9>SX)<\:T6<9MF\4XY7?_C9G'IH0C_A>9!H@O6L1_,35B#G2,I-&-(]:E%N@B'/:=>.1F-"HVH9=PQ5K+-G:#! MG-/7:WX?WBSW-XJ=&@4,NT.,0JT3=).'6B4(2WZ(M-<"KI_G7&QZ_@CSI:SP M&*OTHL+!\JZNJ&NRN>^97OI.Q7BQF>X<\^J,N.4+&S_'QK;"GL:^O%QZ,^N: M\=BW<8]=&F?&+V]^&Z0+Z1HQJXZG=][KN7'L&4?BXS))O ZSON,P:0JP4]>H MJ<&\H/_&@*G9C;,SO%-D&A[&9J.&<;5?OJBWLBO&9L1O\1O=IF^ MFO927S@GC(9OTSQ[+!:$Y^S'-NX,LQ_<*5*1;OMN[0&ZIDRH)\7]XBL-'5OM M;C'6/K6[V7$OU-Z-J^W/]=%+M%NE!C/>"[9?Q,*XU!ZWL^W4,C;Y+\_L:[O9 M_K.C[4KVX!ZWU^W,\1W.[BK+!^_DB;BOZ>1VW?YN1^UGNW7\J*^^A#O?J[>_ MV7*[P#[\.NTG.^BNBINXE'HGO$D;[M#XW?X;@[B->S@=M(]X,CO/7E\CHR8O M,)YC+\NB[\INL,.R*;O#3KO;R[X[R'[RWKS%WB_#Z'+X>QZQ M3[ZYLN'K*EOA[Z=$6]TOUAUPA?#N^0C1;FF50Z<;8XLA97 M.5I2\17\[E+42,K25!N_5V_JJ3]=[VF4\GB_9&-#W3EXA3Z, [_2MN,K]D;N M/:[;R[A+LU[[I6P4\^Y(KN"^"8?PIWN9N^,6LXXOV"X5#[DKO,^NPM_$2#C8 M6[#+O4=["&]NN>FWK Y&WP&__HN[:%QY(ML+\PQ.HL+,*?PG[ M6C"C M>!R[T1X+1[V[N%C,&[O&2W&NWN(BQ%:\]8[%6^JE<1=?OOONF[(UG*BG[,1[ M-=ZW+^P*KL@NAJ.^L/K#V[VKZ!2[)RR^!^]A>L(^Q]]XJ/ >S^$JOPF[&&OR M\F"JL9A-"9/O,3$<3X:O\74\H3?O_M6V<=$>#3?R1V\:WYFF\;N[\3Y)L^PM MN\K^I!.E5/H8W[V#O-9P;.SN$N,?\1Q_QN/57WR'OL>:XV0[(A\Y5^]LO.!N MQJOQHOQS_)=R\0BOAYZ*;]ZM?/0.#"/RP=XC7V=721KWZR+S'"#YB\MX>(%H M#HLBG9,>NP"L>=JN!RUYHM7LI#"@66.2T*$AM=9Y-F8)V0#7_(*%?#W!^D<; MP1?0/V9B9&&1CO.0IB$=P;<&XBT./&D2.=$+]!N] MW8[19_2V\4*/C'?T-.]'7Z5;Z20]);_1O_ I_:S8-Y0K*LSR\+ H3\61].LP,;^Q"+[_; MBX_74_I8;VX?X5P](^O5$]G-,2R?J5OUMO5CO1>OCQ@>5=]Y2O7,*&#?U+?J MN*Q2KYFRZ$D]0%_0"_4 -V/_D^GP!#TYZ]@OUY/],%G9)]F7/=L]MD?VI;A0 MG[>_]"Q]2^\=FZ8CO6B$)P?S;P MUCS>>@U+K+2C>L4,%.$$1W I##I/D"K)O&3[_'/KQXD,V7U84G3HY&XR_?"" M[ZEFU @F[H9)5#7]7C=!'_;)\F _4(1Q%M%$?4*T1B9/;IEGK?44'Q-![&P$ M:EKDG1D:_)2WZ&6ZX 1(ROU#D# P*TVWMI\[1^D2E0OK8=[3^:N'B2ZB M< A!..-=4^Y\E!9@6FA*F/BK"QI#HL0EEY*#DVMCYCO-PX$XB033@=0D,TT( MIDNI90W6S""@HV._S:PL#92F:-#X=0VKG:I$(%)5TC476H"L4P2DME*'>EM. M #TP'SWEB>$+):O7O(_*.>0OCBK!8I; VKS+#[^C]-[5IQP572DA5F( MQ35%S8Z.0A;VA1S:7$A]J+?B'JR!2 1+?/@9864%1 0WHT6?KYYR75E<3$3] M" :)!%+5>(P6?A4T$J.2#"6,Y,=^(6F&%:"$W%0MAE\?N@<=B58GKDCWS0=8 MW:8*8F8[4,/][A >B-WY"3ZR'(9E([)4)\Y]%=61AI+25I9+/.)! M!X0 I]=22++X?^9J$W3ZU5.X0:H 85I"]4$P3"C^* $JP""X"IW%19!0;!8Z@(_ ("H#"G\>) MHZW!+#?Y-2$O V_Q:T0$F-]#H/F!%725YP?NAWYE?O;4$SQ$00:B0C?:?IF< M:N,6I!<#?R,QP=2HLU^[/WJ&FW10+C7_72[N_W:-_8Y#ZM]D6@\ZB&!>SXC\[ MP_RGN5 V$3[^5VE%0)47S_S_\4/'@1;Z!XHPX2M?,+YJCO.45Z;W68 7,]E9 M5=-5+5T\$QG!-%T8;97/! QB! 'T.Y01?S]?^))M_4.C/Y%0>!@'BCG*?-70 M2\+S/7_&P5@+5.-Q\$#=3K"H^&2)5J*)\0+4!UI_C%8;X@PQX]$X'K:';W7O MYUN)_I:_C+TYCBR;$2W"H4==IU639T)+ M<1P)THD%E0K02!494%[1GP01.Z4:H(;- ?@ST $J:MP?DA_($#W+2 ;_@Z38 M)EX.Z*^PT]#,_A!"*RVY.QAD48(8H.G(KI192M1 ^S8:,9QG@\EHP=16.D3, M;/Q+CKEO_Q:0@ 1@*L)^7)7N@)F3,P 6D"84K!D-F(%_"I- M2 P2R*'_%57 ^88Y*E*@^YAF1))'&OEH>F0]DAZ5D1:!(H#O4?=HBQ0^.A]U MCR*!C4#ST1UH$))@;4!&N+LZ\9)&B5I MDFAG"",4DB@)%DAO&22E B]GAK=68.JF=?:"D06^ GF!L$ >TB8I@T0*;(F% M D^!HR11("]P%*A7(_*@ I>!C!ECRO$LD00,! :B2'!0RD DCR\0A0*%RIR! MSW:!I4!=X!R)?D0.+";YSTQGBZ1AX!1I!S4.A"--H1QHTK/HVN!-"G6%HB6) M6XYG^+-=H#.E'MB!NLI@ Q-HZ$ J"S]0!(6!8@>ZD6Y)6:0T4A>)$D@$P 2" MC\)(C4 RDB6P". 0C!ZAD1J!6R9+H!'@$\C:P$#)D=Y(($%5$A7)E;1*@A=I MDN2!*RA@$A3*%SA(2B3% HN!Q"A1H+KE&8B#"@TH+ MX11;H$L0Q;,2C WLE&1!J@8& MH[:"/D'28&R0M 85C KJ \."RT!\45VP+%@9C#SU!$^"J4%5H%+0?::#XD&9 MHCZ#04%B("Z0D(0+A TVHWY0S\&A($!0:[<:I [FB[:"N1CL8'(P(-@;7 6R M!:6#,9@PRP^J%C@,# Z>D\B#[C/F(#V0!>41K"5)DI W& M!9N#^T'Z($EPE:1PV@(H 71)W",E &$P>J0$. QRCY8 E, EP()P"[ $< P: M!"N#E,'(X'"P(YAVTPP^!?.!<<'/H%(05.#D!GH8(=0-K@=5,S@ M X&#:,$_5D]P%3C*P@_6!)^".[S28#*0*RA-HQ&:!VF!F1@.DE.0"&,6Q+(< M!9&#G,%FU"P*-VB#4@6:!Z^" 4'PX().RO4:5" E W,IJD$;H3HP- @B3$'Y M KF"7<(6H>,.)3C@R@J>"+>#74(!'7J0@'0D1)SY!]^$B[P6(3R0-_@D/ OB M"$->/L(U88T00T@A9DZ8-GG:#AR@]^!]V#DCRH8*&0%J=:>PWF"?5TFL(PX=1N4R@,1 <* M!R^$[D Z4CPK$#BL2V@8ES@7=8UDUS/A:](4B#*E!)($0Q>MG+ODUQ4W2%IP MG_ >^JA6B1/HQ"@,"4X+)>F!T*[#$E>9*G XZ@IFASP3C&S+) M/M9#Z3V4"#%A^+%STO(U%L8W0I=,DYZIT 0V^E^M][8'7AJ[ -I#J]32T6VA MFFI..@9,B*@)*P*7" (, #L$4B(AP+N$ .@?D!(- 2P$_$+#P1!@#^AIVC/% M"V5.(I-Z(="IZ[0P- N#(4 #T.O4[]P87AR A@N# 6&@6L31RC4MF\Q/),#1 K1I(D?%6O[0 MM>@7: =E4[;)^[!MBA=TFY!35*QP4[7E!T5N(CE!G,Y-\\$.U&?):#AR4C>U MG(90!L"(DWU $*%NLE,,H?H-4D-[T]70X$1P2CA=#:F&(("NH=7P!T4$>#@1 MG'Y.K(TD@$9@"-5%2C>=#3%.!P)_4](P ]40=!O*+^2 @Q'#L/"82*&W?1P0@*8#=5-#R=>4KK),)ANPAJ> M&98 BD,A@,%IRS0YA!L2G 2'&R>\H9_@X42J8&U("#.'8,.-X.10=/@Y%!T> M 1J'<,/&H.EP;*AN8CFQ-@R#:<.'TQ+@<>@?>#@!G&Z'1JAU4^CP=E@](E6D MFR2$@T/-X;_)X#08#!Z"#=]-MT.#4V/P>,@ZS&"(#C>"MT/:80?*0& ZK!X1 MG)0 BD/KD;GI'(JBFX:. =V@$ "!VH!J"[B;/8<9);LB"TCJY MFZJ'( #5H?YP?/0[9!K"#3E.0RB-4]A0Y.0Z/!_RH+"'3,/(H9UB54@.2KSP M3_IC>AMY#7JLA88TNSK%_-0-_":(8=")'A/ BXD,\#A;5K5)A R@!J#'(:-1 M!0@?K0*2T APQ=804/!=_IY8>IN%&ER -V"$]#5 MQ YQ%*,V%F&JOF9+BR/JBUQ1(C$"5Z6P!%4Q6A+VLI"";[QP7'[MRS4F]$71 M6UZ)*BAO8"NQ5&T"&!Q4 -]!'Z+7@ M-T0 ]T0L5IYH0\8U.[IE$\U%399-HB)05W839 ZR @5[>;7^&6=M+Z58:XE! MVT1G6R]#$ID-H[C4.ZZ)!9^!D:ES&S*J%&@F-!2^GC8QN;7IV2@1%I52A,TH M[O9KX;,=&S5*!B4^L]7=H'IT,YX)8GL0>J93I!,:GFB*J+>>8ER/G>8H63%$ M$B<9@2L! C^1:]2( M00-,( _HF4@.2CY[,)"=,$^PHAP[Y)!&((62*P C=E M,)A*MXG/@;$E9L"G:*F$>] 798$&P:KFF_>1BD2@J71F,Z5Z0B1"(B/8\B8> M!4PK^ -Y&F FUA8QB4V)@09-+#/<%M &O]*BD:U<3]1C_0L;"#@O]!., B(%6$LP6;4IJ0 M-V(99@"*@ QKA%=<\H( 8;AHIN#0S:( @'5 MW!2)O"T3&_X+GN$2L-ZD,ZB+G OI4X%&FQ>N&BX.F_IH\KPCXHS-:Y'$6J0Q MH$P)>X'SHHI-D^BO,^;QQGYEK3S:&"\,3K>8$95IWNYAKC"WE,,(HGA?O.*- MZ9I(=+W9F<+N$8<]P^PIW/!MI+HSVX#K*S5,,[>(XA!OA3U6%.*M5L?'*&^:U]O!MW#O[HL\.OWC,>SJ11XZ,+R=' GA1A_;0@H;@ MP&93U*KDHB0"#*'HB,MQT;(>CZ@;HL\!&O*(0AJA#$@:,RSSH@ #(/6=^_PL M_Z)%B;06VSU/Q4:&<#K%%[43"44!22W#G\<,VY,)&$5V <;#%U7JW$9C_#%6 MPN1L0Y@V%C1MQ&5C+,0E&+-BA+(5%Y?EP4@Z<^H5IK!<'D5;UH;QG;5*R]$] MXB!N63UB6_*KQ+B*:32.%&E/FT8AEXVQLQ>+N7 )&BN-22_L75U*K_>[HZ]- MTSH\>$;^8N$-S++6N]TA[]I>!S;[0ATLG3% *!P-9]Z+<2?K$-8 -I%G279H M^08@T)!,U5%";Y/0 ';E%PH"43-H%98 Q9!'BTHH(ZPEG@>VUO]EHU/W::,) M/1I,?1.K$]P VEC_:5$!#-I+20(>HG9H MA.(&@<@')#WSDH!)A1>/!FG#XA M,G)=)".]UI3)C/C/DP.JH/, M\U0@K@N55>!J25 JJ5HEMDQS+P3E7[Y.4451&M_$/TA2<1"]#N^ Y6%3:CFV M)+PK'# V6H(-W;%Q<3:F#0@F>$#, 7@#*M=7W#B6T1PZ>@W8REL+=6 )J@.D M%R@N*@LNXX0#4!-:+#,>%(E+Z1R[!QK&[;*[<:'90:P&;T?!"+\1Q^C*.S7N M]5J,C+%%X]D-7^1AG)U%&K=K#L:S6R?.S;92'#36Q%B-1<9\"YYM1P56HTSD M3*!3GJJ;8W-!;-9,E&;@@RQL&[1(QE+1XPA\NYIT$C8G3L W!QM F4$R^B'( M1_)Y2X)3B76O;J(CH\X$8VAQ#S84($Z%_OH6"Y9>"5?B_W*WR,RM M#!L^\1KVE[T&C= GH8 I#-XZVCIC4W )8W!V9"J&V4]E@]Z9W'CN(1T(-?<^P\'L-N*KKUS@/2MG;M6?9D M&*%>9Q[>TP'RWQ7?>:X9'MT\.2C"HWDDT+/FJ?:@>G0]E9T[CY7NQ8/F4845 M(.T[[[(1)'A'!7F!G/#(>G8]L3I85/%,VE/;:3S>Z1@SSYXKST@Q!EGE*?,X MQQ"0K[ "#PWR ^GD ?0L(:=1NY[\3J^' \E. UN5BJA+8RND%;B LK(:RM81 M'7L7C#9RS> J&S/_$I>4@794$,3@(^98$Z;RFA=7@# !6:J$E M868O"QASGN3&[**:PTW)YF2/[L?NWWFJ7R*3HR=!'>F/A@2EB//!OV$4,LPE M*3 :Z87QH]J ]\'

$0E7%9&-32+UBI$#W$%R1UH MYU0+N@EI@H* % 32.8_%*'X+KZKOSZ"BP(!9"&_.[Y_K HZ D% L" #*!381V H3QH_,0- T5RGF*J 5S] M?T@/R(3$%?LJ/I"G:%Y)$VM;(BI[Q]V1^8>1)'\M$681(AB5AJ\C;),0&-L4 MS0)#XHE2'V(%U\1(1$[-^BPZA2&D8V1@<",3,F&I"VX [\;HAEYE\%)#&V$\ MVM@76;[QSYFC!T:6)/:]^NY0/9^.9'QI]!$8,H,I'2TBA"V=P.&J"I(O.#DP MB(1$,AA1Y$5$"%P8&HB=B9PT@$BIQ"(,E!B$:A*I3ZTQE] M##R&7(794*P-W!.=9&C5)_$<[$DY1'^26S28-")N."$;.'*4K0+[Z(3+^[I%MF-C$>['F:/F12+NB6JUBJ.A92A"Y%L)W$JN!M$ MF!85;)M)%,MAB4*A+#Z)#" =U8%"7[K@,H'"2$V.E#A;P*6.%/LD=W&18.44 M&^<-"J(^@=O)W6!28'STJ2 ;GTBE!-'!<)0$4**@#:Z%8S L6*U@>55(X45J M#Q M:$HM&$T@ZVBM&UB1-LQ!ZLD;QN;(+2E&R$EM1;:4[Q^3PJ DC=/PJUYY M'>(.EPND$45C "5(VS3L-M0"RHY[ B[GB2#H@K4L4-)+@TI>T6TBHH1"J%1" MK] 9"9,\Y4B+KL)5.VI\B,H>3X2JQ0Q#*O"G(B2L"SX$8B+(!1Z*\5%%H1M< M^/AOH\IY2K,1V&+^2AJ

J+VB%3!3AY';IE?)2617##44ABH;,PG_,@DQQ7,8I-SD ,% M+E(>K\K!I*=)^=*C#!D<"<86"Q7K"7%)Y0BG[-+HJ7H'@B/F#*/*9W%:";4M M&O(7E8?H7C_.N#4AJ+\E3\95/"P]&GF+C_99#$/AR%!L8A+<0*]/^F*M 6Z! MR-@^G@.QF9>2\+>Z&FK9GQP?C*.] %L(=JY/U\ 2^E:ZP9V0+,@XAJX#$32B(?=F.6JP M#P0H+9'E0QL!M: ANK.,>_B5LY.\#_":"+V67_.H01 M'[$(+;**2N^O:8&@7%[*+U$A:XOF)NOD$*B7"C"[8YA/[N W;MK\R6[0^(- M\@R8NS'M'>9.@)G 1&"6TW1A J\?HP*S'9;$8^/MQ1!V :]7'0339;>U"^0= M[:AE!L?O72?/B*>QRY3-V5AYQKU,GJ^L3H?Z8IA=[YQWDR]='B-OR\/%XV!& M+0F-J<9"8Y+-YZ6H@W!5+7-YPJ]L$JJ,SJ:+DUI6[7*$@KI)'HT2:5?[&B#% MW8Q?J<019@2S1-&.::;-YUPI"61,8=HR..=J?T*MYY MTE*8_BT28P^3@TF]DV(R,7-W$S=3G3!Q5(9U8\2MN)Z8,DP=YE2LANECM$P) MLB*8PRCEG6[ML7;%7-ZYO.IX4#$;9BEO%J;')..9,.]8I3Q;X\(M@AG")'MY M,.E=;CP+WIPG@UG+VMCU+'%W!L9,H:HQYX6B3.4!&9L]XCL6YA%3A+G =&": M,E^82LP39@#3E?G E&4V,6F9@,S#5 0-OV%E; U,OY9ODYP;H&;"PY;U*"L9 M6?YQALL7'!V#J):Z65;->T8^EAR7UOKDDL@W:2K*^-9.UA>?BX0A=[#,O*H< M<'@,, G\ 4F"=U [V5J-%@!]H4K6(\1RH;6Z.#XY+&-^JY7SXWB+Y*.>.BN> MKF09]I&($@I-K8BH&KR8,%P$H8.?3W?#VH>[0A$=F3@,D1I>P%:QO)1J$;/6XG$ M#' FI17] LD'E,!;:J-Q'<\>_(_U0",%F)E\D*_,+.T8EYP64%^FTI:DN&B. M3! B)TU)@]45,8>6J"G,D^3IBEG(5))$T)X * P@"OFKAA89*:.X M"WLF;1RHG".!B< 6L$N&(K-O?2B_SG,CE(ULZA%H^'),!2"?B<,"ZPA9. M]UB7*+ $@Z[PU0'79%CJ5^ RL8TT ![ "J%]7+X+"CV M4#J+CLW<2O\2 )G+E*\Y":68@BSF6@-MQZB,>V/&8B!GLL:GI9_1\Y8W@XLY MLFB3-<;2F?+FC1N!W>"$#H.(]#.MQG-^I_A M%*%P8S=,HU'O)^@I'-5YHK"6(SK=9M7MJC=,M#4R2+QG=4Q UE/3M8E-"I\] M,AU/4TWRYG'S-^C%4V&Z9H)K?#O;W@\GIKCV.F4&<;3!4ED$O$A9W*[(U#B27"CDD^%@:#!\A.]= MA4PA22TA"O6M>D+-TT[Q]Q*;/;03XDCIA>%FU/TU%[=SNJT1V9%"WQ':LA;D M 6*5.!1^P4O.9?-;6DM2\[9"LXM>H08"\D# &6JI%K@0L),[3?AI^F=L,E^L M.8X?AS;TWF'S>[*V-*# +HLK9(DW1#G'NAA'P?/A?2I;*LN1 6L+&:1W2%E6 M.%^ 6K#^17XJ>,3P, +8<^R7Q,NEH\(RA^;3""6LMVIL3$W_90$3IZ?"5.M5 M[%IXMC@97MU.BV>;W.]4])23BC)AFC8,I&?8R]2!]7!BPLEK6X7QSOFU&T(R MD699W+LA7E;/S^G"?&#&)D\\0YE@3W@S0:YBY-M79IU*5Q MTD2,W#8#FK#,T-D<.WOELIR8VTU!XU,&M69BM(NE-Y-1&$:J':\LRO::O&3Q M-BF0O*A99R[P-3;82S .-Y>8LTQ#G+'3=X;LG$R9[9Z=P#B3GC=%UEAKC'@Q M&FV=(;WC&!83JVGO0G5^TE1Z#-10^1G1 M)K0,2DW-A]ZF;\)/8?"EF(QOUB=@ FF%$%C[8VR6^U1DT,KD'(JAJJ+?R\<] M&M!4U;RF"371YN9%41=80&)=\D7]BN]!LN66:0E)'[ >YSP\E($RS;E>9->A M82R>HCDJY\.2G@=8,C_U*=A1D3Z[09P%(,3XH5\5'C@+3X2="6UEO,/D M(W\TA*@5CJ>JJ_CJR&QVM6(+\FH&FWBV$"$JD!#'KX-MGE*9 N2 M AUQGK6GYR031;@C_+)%/:>#V3C@IOOLR\8>W";9LEZ*"\?(E(QP=];T1)PE M/8M(ZTVF9>9-A\1(,CR]LQ1H0LO1VJZSY97VM..E1ZZ>9K8O'=*33@C%8Z:4 M"AV*=+NZY]!RB$,_"T91/4EKQ2@ '1.JR5/0RZN9ZD1934*OIRF-=$8_:[P=/@UTK:>_I]1SD^DBI";9[JB;R,U3X<+).=8^Q'9F MH-IX_4"45^RSDC?[5,P@]T!_@$A4Y.'E]KC0P'>V>]ARM4*L1E6-A.;5,B6, M3' F5H]TR"J#T$Z'"O&%?<$]TM M[DB=_T^47DH/*^;::TU60".=!=!$YP4TLQW@-4 #H !8&F MIA2/"]!*9P944KV5U&B%[F# \H13/-!5.Z67M M]*)1FDRAV,U.ORD#]7^V0#V@V+R5WA*T" H%O>/) M]+*=1% \YROS!!K2@X7A]@AVL4W571_/T(EN:W(=QRJ,J#6$F?)KT?F9FH*: M0&&9CC*;7O#K"GK[DNWQTI2@VDXF:!9S!'K ?(,R[X!W(=#,'BG,#HH%)82N M,KF@E;MX%QB4"AKN].E%\FJ@45 5:-DKV:D([8**0&V9I4T^*.K.$0K%I(/F M03VAF] 3:( 3OGF6(CF M7A(TC+:NS6OH2F"-#"B8A-P V0OIP:**W(9]8_ZX#W$P0'UKA> DSHAP0 M)K\E'='?PI8H#;DD -/P-G)J:9<51^'F-#'9E";2:"*+6"651?9A=8'>ISR-8?&D>1L, M)7\G84X0 _11G2*_*QX''H"-Q4@0\)C_!CNN6QR;$H&)"7&1[7KT1.1A6C\Y%))+-E(P1^F*+$/^ M%I21U2IE74] /< ;X()L/QIRS2*.:+C$J%3MN(*P0]T"%IJ&Y&!S/;G'D0F9 M3?(99=$4QK#2?T!ADXAH&4G0' %B2Y0XP(!< M'$(T30[T:#7O))GY$[&8%IT/I!7KD/6'R>&J2(((V]@O4)DI>)'M-3)=75) &(BS;W"X(OT,BKY=[(RID%<:?Y"XPLIFD#B31P!W!74K/G8G=+378:]28\ MI^0]+($LAD]KK6GT#+8-&;6@ #T:'GT.1U?U>BDJ-]&8*\4>:9<%T,B?,T9U MV?QS-4J9XJ@1:1=I%('62@5F"TB&HGSN+N8JG4KU"!-E[#!QFPFOOYA1[*45 MH[*:HU(5*8VTQVC?_)0)2VN-W$W"F&SL+';6Q$-Q-PZD>$HNJ.L2XTFG2[RR[6X40DH M)1D?TA"%S!ACXWC>-!55&+9$6L$4/4I7JSN5$14 _<_+% 9S"^H"C6)* M,NUKYZSQIBNMS[DL5=-!Q"QE3;U7(R'O.$E**\41'&NDT4U^V;23CFE(TDU2 MN=RF=,X%#ZBQT9A1-(-B>)II=5-Z62Q.@TG'4W9^.MM9SS24'I7TV1G8RR91 M.U&=%,R@7BX/:ZIH;&&N,2>8H5#S'3+O5^>/28L<2O@I-C#MP>&**-?1LDIJ M$]>=Y[JWC M* ^8R\G)Z9V-M"D8>Y>)\4:91[&,7=ON:YK&U'$QW-1EQ4WW#I]QQM@8&Y(6 M3NUSB$?LV0V/*X9&))O"TD1WYU-*SS7LB!,^%:$>27F3'M2O*0@U@\I,:W%Q M4+N;O](*:F+J@IKIR9Y6H6IECT^_'O$.TSGKE#PV\KIESCM*GLGN(*9ZP[&U M[FR4F#O(6-_SE&BF$L9A(JLQ1:HN,WS&4/%N%Z\SVP:2\(4.8Z": M$MNGYSBQE(715_K7.S1&VTJHE,[8FD41NC9,RYO.$M6FN,XN*AMT?CJ7>J4U M>F:)]]/ WLX.B=JW@Z*F&'^H3519'EJ/JC>+&V!*C(JHGM*<'6ZO98=GE-X! M4 %Z@%31E .41KI#M4VF.EN=N,[U*;'-ADIIW*,RT[IA/TA*#QW56;H\6\1Y MINBG7CVQW7FM08?G^88-W.YZ,:Y<:2N-:@=YS'1&PAJG:%048T//@JHK):&J M3].HDK$9:B]UF^5HG*6N37EEMM1_UR7,C(H&C4"Z4F=IF493(X&Q\ :*TG1J MN9II/CM.*H@Q./9)':%>ZKHLE=0>8:HN!OFB,4&= ,P3W;#4E>I,;1A-35V;8D\Z%I6TDD4_!8Q1 MQ^)22#VS:0X2EK81,Y6J2G]L&L:V6ZMQ"P=O2Y7J>3R,;+%FZMV4),;L/"E" MTSXS)+S43!BS9F<=YRY6> M5/=S7502:0.U\OD]U4$JV6114E(7I(QQO::98I2!&O6H2;R/JA.S6'I!_8W9 M45]TL3(VJB!/S890)6,J5,FH<=2&JD01QU-U*R:630NJ4;P9Z3X5E-I*]:>R M,A>GNS%\ZC5%W0E]"40!/2NE[0RQV7@!#^"4=#JB@TXO^!6ZQT2I#.,[J:*, M'548?@FL1Q(CT8=W2: T.A0-UP2QB)$%D.+""6TY1')3-D.\2&WD#N7F@$XP M+DY;=4L0FKKC#';D=!U94NX#G92]'&O"GU@WX:8$$>PX&H'[LE- V!R!8>"L[3.YPXT%[=P)*3R IV$WM1,V1O.\>F?TVZV MO5BIS3$?J-DS2BCZY V^4#E9:DPFJ>.SE?;?1+(92;U>NCTF5!(*OQG,LGFU M49^:UJ3YVGYSMM:V(R;"O+2KJ2CNJK4--_9=G<9-5U]GU=6GW;%3?DI8BRG> M REG+D;H*BEN%@/>7,48UNBF!T8E7EY-JG=;Y7L^5X-A@;.P9V[5]&F7.N*( MH)!C[U59&@M3!#47HZUN\+:D-"JTA\53YT'ER*IQ:827X= V6CO3#5 :P?L1 M/LX>ULQU'SV&8WH#JR^M=*B%##DHVJ;C"38$BF5\^-H"Y$CM!-!EM("M[)^L MY1B+D88!AI O/,1@Z>K<0HQ':B.SXX%37M5HX%Z\AY@748JLT#\.OD=ZH%*@ M,^YQP!6M 4E3\GD *YYD2.'J3FQ:,H7. "-$5$P'M)$*B3UE]=>L\0U M6#VM^=6MGN8+N=KF&:[BW"E:( L+2>G1PE-C>MTDY"#A-\HN;A MCK(NHP4EBZ6UUP&8>3PD'96G;M+ ZAJ!H!'N@T^>6 R+[ P47%.$3QGHF 9Q M*V%#N,JU)I!")!IO'#:Z!:AF<(U^:_/T!;<7K;1R .LL6C^=Y2YFM2EZ$P?Z M%/>F0+%ETG^.._A;I;DF:WY1TC6!4>71F_3S:J.2DWRNH<&NYZ3PR>8V%2%Q M"@F0/%>W)\XUEA26^J7]7/>,H\2:JXP4\]1 NW1^%/MG.,HS3%^Q3B1PY0#> M_@X+5P.,A12 W" !^K=@&-"6E)+PH_#4/Q6YV5ZB+P$4"4E"B<;EI# =L T< M1J^C.HHW@&W I?*N; EL(GZ?6" 4QNVQI9)HT434-/./]=#1HB6#YF(C\.:5 M/.]/K0(()R!(6]0 LR%J+RFM( ![Z_=QQFEVY?3578E@;ZIYE<_G\)K_K(>J M7+UW2-"F&"34#%J?$X3F/0.J7=4!*&?LIBI[/:9IXV"O*]!?J57OA%HU=99- M-=>K@KM\65HO0!:0.4N^8J,:YV^]U$1=\K67.R\9W092S-EZ=2$6,!,V78D+;>I[;ROM=4 :%TO]>K@6KV. MIB)H%!\Q$&>1'/D@*$E2,V,JX\J61)_4XO =U6D10T,L0K^*:%/4:^$@S7W2 MTQH"I1+IWA*(2,#&:"/(,,(ZJE%CBR5$\\K.J#!97/ KI1+&*#52X!HSN\Z9 M2:]H,:JDX^=U)_)YG5.U)@RO$C:C1!:M'6%Q-6ET7#IR,4G>0 96"YEB:$1" M'32PHY]39+VD:_/.X(SJ794H_BFTS%H(6VJ"55AFP8(G<(GO5V14GJ-<:44V M/TRN.<07D:P$O12#[7GJ$P],+EB<@&!@W:E^TTQD3BVFD1\*[),C)0.J!+W2 M8S : RDX7]4$W.>/5"YMG\:D6!3\V#K%),>^*93F5N)/;33TQ_>$28 ?63]N M'G=8J*&,1KG!:@!@L"OR3PY*>L5:8WA! M-XMA*[M.(T&UC.=KC9$.OLJG2;I)&("5518_C:B.LIAZ^55=*UVLC1HLM6I: M5^>KK-@[YZ)3VR9=Y6T&T]IZF2E*G>H=LG2I5=1<'*^5.T8XI8%RQ5!1H=9/K/N41]?$^[1& M24V,J;1+;%YOXU7&E+XNV[*D!=2L)7.R8W0O,<0"+C5L/5;BDI)S7Q-[) PE M,PD02LX%+&)S9,K-;%M^&?XU]@=KWT[+,9+'D/'98]^+;("6B#P'$2%F/(]6 M-JDJX2IDE923^8*HPKQ>2&%#-LND *>D(2HQE@R*!+Y8=IPW:Q3]1%ZBE6-_D0 \;: M8C^H8KVF;&+L*6LQ>L7>6I.QDK*E;*0N3IAK=<;FL:"Q#$;#GM65ATJ3!:K: M9'&3.-E/ID<,?]IY8W;B2CNQ,5#4Z]T-B@>ST[KI\ )?N%<19A;T$)J,P;"V MT6!3"$YJ%;:5W)J#!0Q!*:Y?[!/@2@=V^3,DRG?LAEZGK4LH8S\6N(C'R*RF M)%),WJ4/&4V@BR8PS<*(\QRM\3P+J9HS(_N$S;PZ8CVR1E0)9NUU)'L Q<32 M]#Y<+=DAXUM,%0N?&[7&9"6@.[:_*5O*U$I-U=6E05&-V]A19ZIU><90G:4Z M51&G5EFE+*?.A'?84RF25_NH?-,DZM0R*?OXLM119XFJUMGEK.3MJE3BHA:7%.<@V3ZDK4)NER;(K/B4VZDO\ MX_::?AP'7DG'U5<!+JN)K"> 5P5M8J"\3^J5N6I_EE.D>,A5HHW;63.2M^-<+Q M:6.,V;O\["@5\TB4G<\.9^FT*-D>*7O6&)4_/62*4\^SA3PY'EMV.!G0ZW7: M4YF8R-E.+0B3 /D^S:->,,6IFUA.UJ3VF]83HXH9=K:HV]<5IEF6*O.G56Y& M&&-YE3I%)Z+V$CJHY3 :S&2I@-I IZ"6A?JTZ[T22RFHM-HRG38UQ368S622 M]D*U"3T,Z]!%T.7GN'.].Z448, E9Y\B9P756%NM'B>S<%*;%6'DLM6;*G!Z MV)*/E$@4*[AK9H8-30IT71U5B5BC1(4HCC$= '2_A=>)YU\61VDN3[H$YI>853":P\IO:D&3%0[E\\?OH MJ1Q"ZI4(G)MAQSG1G%F=M:YSE%=USN)((I1BT*N4.=(G,(]F$42VL_44#9J^ M8SE\^1RP@Z)#O8'GB,QZ'= G#]FR2'!KH8&&.5005%0Z *K-)/U.(@LR,+7T M74D"*I$'R-LU\M,9L($Y*BQFQ#\LA]TO$(*7H%163%!$G]%0$, IC8;.G!"! M.== D [<4'0C2UE&P_^80(0E0EN$+-,%?^=@VJU4*AI"O)K( 0 &;^(P6<0: M34,YE]*.++HKTPJ)EYE9*>\I=J\5* M9U6H6=GRJ;CS6 J5O87U8KEV ;?H;'<6Z,J4E=U:7XFQIEOFK!1M.P^W$31E7F"KW^!H*+R,;PY\#LGH#RX2(/24:UD$ MMM0E63YLS%:I+^#U . 95DZ6_!FSC[*H3L+X8)3:<]2D]]JS4\3V.1G*L86> M^N@]Z06&"81L?TG2@BKYM=X"P"F?+?[ L90VR ^ 7^I$>\7BFS0!_-+U*R=0 M-KT6@)5G%Q@6S9@R(&_L; 8O =A :TO%3H.=..$JJ@B7"9O'JOSF?Z*H5-&:?T56@CW&[<$2MLW4"VZ-.%\CXXB+EJ(#61V\LZ5 MZQ2)N9%3A,3R-715RW&*$ZB,8Q3305QC-I%>8MN"8-^V^) )[LDEB"O B(_X M7Y2GL"%RE+[32_18??,A% >W;UJ=*B-4OEH9PWKUTK!Q>3I[RZV5ENJ*"ZZ2 MQA*9S]0 &JEUC]I=166Z5T^M8UD&XZJLCOAKO:XRZ(2W,\8=YK/M=1N7RL^Z MTEY('[%/F7P52\>=]:Z"5/5Z>-/@[7CV\+8KR^0B;U>EL-=H[-;M].8]M=Q" M6*&OK:S)[4OV4$9KM-[&N 2YR4U"[BRNT[K -*GN8HJMM3W#K'BTQO0U4&9, M$X1*$UQZ%MO6A/O:8M?%^\"<$T"DU9XT(]4H+3Y-$E(;1@&B!V,Z3?.X(%DIZ.YU<#=0EK=<+5LI-,Y_^ M!]>K.+M.+B=-CD5D2]76;KFO+EE&Y\--D]O(9:^>N*\O'1<8V M6/^H_MELF.2I&:M]A7F]2AVZ8L^!KDGVEBO(/>BN=OJY5%4=H_ N_:J?;=RN MV0:YFL[TZSD6."L+^]/:MH#UE+L.3R23MRZBA,(*%:*"EGS/7J#4T(.=F M578=C@2ZQTWE'0O\>[R6?G!NKLBL[9PD_;F*1'/R!2ZRC]BH6SS7)S;&I,T. MQXRY_;(X7O>V5(;4O:FJ57.YV5B?[C(-V'E8TZ\U4V]>F]SM7?KUE=N@P\]) MZ!R[#%U\+FT7PR;@.YB%Q6+7;LK[O4C<\V=2^JBMVII^'6H7?I2=^" MY:PU7=P"+IJ40-HS4G,:<<>2ZP;U29*R9KI=@8R&==VQ15NYZZC$^W"AW/\4 M_Z)=_Q/85+BGJKM_G5WL,P@62U;ZQ2D4F7FN=22J9CN>KUD\[NEUKML(!=82 MN(BYT+&;6%*OJ(O<+30Z=9VO_U-^*J]S%5"\8BQ#-U5J4G15@9KQ8#Z MI7)>J#S7[>ZV,@/C#9\26!UY+%T)*V77U5FCJZJ2W2Z=9=F:+H(75MM/?9W- M[C*WB-TDSW!M[2;),^0B=\FJM+I1K2]WWG;.\C2RLCYEXMN#%PFT<[>6?:U& MO.2I[#24C;321[-5%-[(6[,Q8RIA2)WDM.KZ^/6]&3X'3]HV:Q.$S3K$T-NL M.%,&!@28@/3M#< X$;;<-8 2@MYF0:$7X\)HE1\X?-)+!AJ99:$U+/H1X5IQ M9BL7-A!YH9>H+$#OBVL(!((2=:(@%<%"%>F6X;C@!)*<")V1)L 5%300L%[5 M6@F]&X+40!I'W1#LK49A4H-QJ$R= "IK--8 M"307JQJ43J< :4M:">.N'HHYXL2'#O;+30I1L>E =<8?FL@XY5*''CO58;^< M:)0Z7IT810%$$Q&H&>LPL=1DO]Z,@\8:XQSY7G%P7%.^X0 M=UR^*M\>*F5GOJ.*H?D">L@\R)U_4S;>"?4P M?%"^SIY/K P2Z8M114".?5=U34AL&G,'F]KS3>^T M>%P]1R61==DH\8[J@[U@SZ!N:TONNLEP]61Z=[VMGTG-MB?JR MW7R^@*RH;VF&Q!/J%/PF=HJ^B%\K#X=KU$-.B>^8?8]TT9W];.5WZZO>R?L> M>#J9QZRQ;YTGSQ/E&33:?0V_U%KY;,XWTD/S'4$Z;P]FCM\CSZ('-&7T+?1\ M=QQN,Y1 #Q$&YZODR?T6=XA>>1[;FM17QB/\G;M=\&@[O5\%3RV&RK--Q1\A M?P60C)X>)&;W[1OUE?3\X6*_XAV@;^"W]4N-FO:T?C>9WAW'KZBG^COXG?4 MN!2_S![L;W4'^WOL0?V:>H*^[]_H3OP7NT/GJ4">>>J_/IYJ3_LWP4/V[?,H M=C0\ Q[=[ZT38:3>"?Y^?;F^MTX!3YHGSE/@*NTX>KYEP]]K#Q.I\QO\Y>P4 M(6&D\IUI2@$8V0/EV;*!=N)2^M__+]Y7!AF+V0!G("' 5)XJ3]8W_WL"3@!' M>9Z_3E\$,-1R 5SD@>UXV4@ ,F <\ 6XP8--4N\(@,V_/;8,L'PG 9G<(?PV M>?$\.F#6;V?'"*SMZ4$*($,[^-\G,'4G@M8J>;BR:%-]XL:,;[$7'OK;('E4 MO[(U]\_ERN7R:8!R63G876"X2YAQQ3#B$PF&/=J,>G^/^X5$2\FDB@5)\,!$L*9C8$4A\-N^=0LI@^ UL'FE;]"X?-DH M@EE5;8 ![^RWCT4]9;/UM^)8BU\^78-5<7>)8^UF/;VIK\1('%>65$J^V\'% M$E^,V#8E'(CN"D=@M7H2$ -@+SB7JE5PGS,1R$@PN>6Q$[)3]827"K(CEN M64]@",]V7N?#WG-F.&>@C.; W0/*QG5 HZ%V#-/(*Q.F7@5VX>FDLBF)5!>( M90*^<"C#@\EO,B3#P9Z$@L$S'\":0?R+MV3ML_L%)&U^?)\(@AIEP.?XN3 A M?_)H2I8YR*=HGH2PN-L^?I0#T#^Q@%< M_;X,N01\BG>DXR=H8/A5,_()K RJ< ) XJ1+_OY!=6T0BH_-H5++]YBLOO)3,'R5S.J;B+7HN:W^E'4>'_R?FQ M?GA^36%1@\^O@*-@ 0#MS&P_1;^K"O9-,&FF$4],4E*1-^&XU8]$ : <:'CN M.]ZW:8^CV=0/%G2D*IT2&.C"=V$")<' $J(]Z- XFQ8-#IEHBP#%.?+H2TOF M:$8_($HE2VFX).HAPYO$'P5%WH:0Q)GA\Z,YF>88[0 M6RO#=!66Q](*>R+_DZV,:,9+D!_#07?$G2/V08/D;Q$B^"6\C8:M)5SA ]H0 MA;$CU!EO[?!G9X!9A)WJ$RY4:I&^!:G@"696JE)!!+[#H&&%#C\&[=?M=510 M"IP"P2+/7T"4^6G0>0VG/P=XF%?D,$*QIR,83)HAJ@7=T0P6\(]=T;]S;321!1 ;TFA-C+_X,(>&9KDZM8&Q M==H@.9&5BDL@KM-D:1!'34FRO[Q)J!3OA@?4=;+IV$Y>;CJ$F"5U6'I.DREJ MWJANL-0JIK4V559G!';>ZN:>@%-(EEEL(59(%7EIV8JMNMRLG5.,&WO*%.01 M:L.HP3@K%Z4V+>OW?-R.:G.HC"D9;VNOTJC3%9%6\8*H?KS+'2BOD_?'/.K! M04^=D%,];GYQ"Q M3GS#2F)5,8$H2C%#:*SJ6R,9,EH_3A(#@TOON;8>B5%=MYP4CFVX$ (;OM((HT7?2\/!NG?!=AEPLOXC'9DNJM=3.QKZ:*U*N:;OK\09D;*]]9N!G?C*^;L((H9>%>]Q] M=&MZ-SS6*^,X[XE)92A:3[6R,=W#,1,/<3IS1>F.Z?AA;3:F[!NKD9KO6NUE M6>"O;:Z!Z+QJKN6@1=(N--)]2N(43>0 < Z!8@5G.V MCG&6Z*ZZ\4<6$L;(S)_*::E<_1L_7]%E<#>R:B63L>:[I<3Z M5(.D\;7*,3#7&6<$M7;>!M&Q#SW\\9UV,(OGA(3&CQ]V1]TN'N;8<,R7%>:- M&G.=OK!5G#K,69J*F]$U:O^@!-!YF^DX%Q5!,Q787UNSG0&"W)H6'(/9YO'TNCBQ=B;@!_.9V )N5IR2$Q[G*(]F!8&35) M=(I\]A>3,':$!\N86R'?!,(@Y,D:4RK(0W$L/!PA/[@$'#=AA_7+ED&F"6P1 MAHK"W1$WU"@2#<1\N_%1@IZ+VQJJ46 (_@IV*>F6 2V=\$]5 %A?&C>3D7FSW.Q(=3!B/4 T"W:.\IR^@9%,1G2W.4)@)H-:FLF 6@D"^P:B$%5T M-M 2I#FSP1^J5;#4V-_]+B!"Y,4"!)M!,O(2[6G>F#X:T!\ZRV$8VT=,'D5> M/P1 K0*17\N -H=,YIA]A#B3)"KPAAL7 M4IQY=&-X;CHVGXH/PV,J\8J)H#0R\:TLDYK='!PC4T&_GUQ!Y_]8H5O84^VZ M] !90\S+8S1M>N939GGM8@6,PE9;+9EWQ@MV>^UI;X=WE&-(;D\9RC5D(YMJ MPU*W^MD]74VY<^QE2\;>E$-CD]R)720TIL=.(^HX.[2-;JVZ!$#2K;D&"PF3 M%WTGT$DX%;3 +@Q?"%$8"Q)"4D8E)>I K?LL)G=T*Z.38%TO++ZQ/^DCPW)0 M62>4)X5_R:N"?=F2!$HZ'A;*>X'1))J(7\R_[!*KE,^WJ;NJV_\X7A8X9?)" MD?"Y@C"'XF#P'B Y)BHPVI)P\!0\7C+T62C("ZZ7ORQC]B_7 M45FO)M39)K!TL.MC[NP9\H3,MLTHJI$Y1"=AOL10F)ECA>;$)S )RGPX+CQ2 MF6-KW%DL,P]SP4L+:Y;A30/-?]3.,HFYI7J!###OI0;,$Z\:\^O+S=PP0Q5W ------- glue here ------------------------------------------- -joke -- Joerg Heitkoetter Systems Analysis Group University of Dortmund, Germany (joke@ls11.informatik.uni-dortmund.de). From cellular-automata-request@Think.COM Tue Mar 9 10:32:17 1993 Received: by mail.think.com; Tue, 9 Mar 93 10:32:28 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 9 Mar 93 10:32:17 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 9 Mar 93 10:32:00 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA27934; Tue, 9 Mar 93 10:29:23 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 9 Mar 1993 14:50:00 GMT From: heitkoet@lusty.informatik.uni-dortmund.de (Joerg Heitkoetter) Organization: CS Department, Dortmund University, Germany Subject: Texinfo version of "Spaceships" by David Bell (2/3) Message-Id: <1niaqoINNj1o@fbi-news.Informatik.Uni-Dortmund.DE> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM ------- glue here ------------------------------------------- MC-0-X4L@<7?EW>NO5%O&BDFFU" 3!K+OFI?^?(#Y;__#EU>W+@A 0-P?HUFJ MFC$J*67^]$2D&3T,*T]GNP10,\+6-BPR[=UX++/8^>"^472P M:>Q4091FJU'B=&G%<2E+ESLRA;6N'A>UJ(161(KTX]?<_Q 7EJ0D]=J'.<-H6!VQ:2(U#M/H7GL M=P.N:]KTS5Y902LXL?LY1GC&P1N?L7/2:$/M#6QB-*P.E):;2\W![BJ_0&CI M?FPNEROWKM86,4SJ^\%.77H,H]<4;.FU.Z'+.7N$?!\)V$_*;&!R:,"M32 0 MCUDT][O, 3ZE/M5_)<#^7S\X;F/[=S\WN6HH=XCC:SFVE9/6;"<_/6[XQLIC<_ M=27%QN91@J?9/ZKH-MC0!A0RZW&-BD!(-P!LLD0)-7IE%@ M.32T%EK@YY^%N^QVO1N<;MX?&ER\3]%A:U8P1:G1XQ(8;9_Y,BZCK<;BHRS? MESD'^65J7K#Y2TS@M<2!QR"8BF<[ZI[9CXO@[>A^F"MB<#JX*>@9WKQ*[8YQ MFV&,RS0DTOVYZ37I;)0]D$?,BF;5LGT6>2;?]*J64_&H+LCV,S:5?5Q3-MY2 MX\[/WSO^L9SY5T=GCC=_0KFW$.CM75T7RXLC)8I14,'-[.>*[I+00LQ:MKUN M;S',J"6(&9Y_C]G&B=9GV74*U->8W.O0Y2&L')&EL.C3%J_B9NUBMMKMDY!ERTU+5:CY)U"+N1\CFYE MWTIJ1^.79#@OP'!=<2^<$\_.BR-Q'0]E*C?46E]H&RTB,0.,<3NG>GQI91!? MEB6A+F8'-)L9@ S310:C-&XVA@J+1JT- M@#^UICJ;JBH:%:V357;RU8"Y5*E0=/^9E@N*9JL^J2BVC)7O,VY1,^&Q[6B( M''9=E1<2[>/A9.'?^)8V.;YUDX=AA_U!LEIKN]?QFIE_XV>[L>V6T"D+4_&> M4)%MQEOT*:73\LS<5.TNUNZGXU,@-%5V'!LDC)QB5$W+HKM:;+J9#MI3379B M=F[1T5VL:J#QHAI_'C)3E4N,F=RYZ=S4MH:.?D$+8[.HU4[$F%7L'*VQBSU/ MH >HL5D9WN5+@:E^%G5E2A0/1\' M.A.[ VD>KX'YTRJ]?3][Z?RT.LB ZEZW)AUTG#Q:2;'Y M53+1AY_H,X8)T@L*YBNG:RX.HJ-)J06"-ZSF5*_P\[+'GVA(6']6F'H]K3]+ MW'JEC+KY:BGSM^FJZ^J9> ?2;N*P]*]V2#J"'DNW-PV%X5CT)K?9WP8BW6*R MH\^\Q-2<--\8::<)LTTG3G'33.6J7BHZ.'M)Q<_A4*5I<6GJ:XT.\$S5.TW7 MI6MV#NBFD\-!8WE'-V?@YI=4Z6D8BOY<>3'174"GDJ M7M.[*5HG&2K4]& UP;XH#-XSIH3R=)=V#=L.=O3>(](X&^=I#;^*:-M7!#E/ MCX&9K"H4QLH!YGF!M7)ZW":]T! XI=I#D0P19FJ-;Z Y741**6A8!' JD=;E M ;R/?>B(BGZ/T#)P,&B&HRO03ND']#WWC/K587!E%%Y8+<7+Y)Z!MU+73'# ML\+3$C3"$-1,5&-Q$3CK-7JF]YCWZ-[AGUF\1L72V:_KWX4\OG04U<@@H4M?H>HXW/4"82XEH(P4=$ M(>X'WAR7R>1&16-\+(-$3"9+&J"$RKDWM-6AYD24((K"C0^ELPA /I+HBCO3 MA-)M6#$0PVB?@;CEYI6:V?9;9J'ZQ"G M927-S]E9(X[:Q[O##.(!H2^,L$0-KUM6C$6I]3"NJCFZ2^K_LF87%B<,8R?5 M,LH*T=:.<\5R9L+_40@!=8BT;@!H$Y_Z2BVIQI'8*2#5;AGE [E6 C&XA$]R M?!9A;F1'-4GY4BT?YKR$6QTVCJH+LI_@_+F%I:'U5VX&'E:'@[A8;*7.O,[M MW!"6EM>'*=JOMTB3LT+#F@/3)ELMVHE-4G D\D*Y82.S VNH Y)"MZ$^9\ .8]-8$3A1'/&--&X%"/H MK)^ZP^B2;!NT:ZV65J,&56>4,.J_\XMXU K7TUDW M'JW6#5TE-;+T:0U1C5HKZ*S*X]28-.8MF=JT!J;*[7;4%] >-:X:@$QI[.G& M*'751%*D*GZV>?N.%F*ZIGVEN&M;JNYZ<)RU5DC?[I#*M>LDM=)!1$U3)DO%Z&IS539P*BI']$D4W*G[XUBQ;,ZG.VVJ)N;7H=! MX3"L^5TKCNCT-Q=WTD[E->779X3Y,O>RR4'00'@N)[BE36+M)6^1 457W,RE M+]P(G U\K<+YO4 R-&(? 9M49$D&1PIANMPG:%6Z%UZ,1K1Z\JT*$CFIF2D/5[^8NUZXA%69DZ=B8&G6\9(PN.1NMGVXL_V7-] MLZ'%])SP8W*F2]TQLV#(*))5S*Y^S49BV8J%V!"@L-TB:X39T== "A!%P##8 M:E)FV)J=(3O[0@(595,K>ZO.>UPE0-&&W;I@$.?%/4R M3%]$]%?0D*1U_:EK9EQGM#BO^).&-H$%IF4; &-K;VV\Y.C6,BO:#VH#335. M9R-[26FA;/^9$XJ+_JG2]JQLR=)\F2?4T^C3OF:CO0:=I528=G_3A=JFTX,N MV6;:YE? '=[XFLVGW=R-]BJ\BEV\\0 3!)I:F^CI:?.+W^F!GA/T:AHF)G>* MM;6U?>QH[X. KLC2/@EX9? EU- QD3?242%T04,+8!FB&AA$C&HA(4G(T(18 MG<,>GH.Z=E+RB,6=I"%:"5"PED1#40OVF?""_;/R$.S:%VV\MH,T"!91T<$J M2 -;, K]F*O@L)48S;YT0[NEA(AH)-VDO.!O26E/9+DG2:&B3&P& 9@FH&FM^?J,%JQ]VD;>9Z4E&9T=39#.<7TK"1>@!#&TKUU1^9K] MM5]$8!0A@G(%Q>006FPW):3%6)C9%DGXX[$NN<*^"+*P_(F72RPB?A7J@(SZ M-0'3O$8&E*)II<-UB7710:JPY*^FW!HL0=-TK)I=CQ]S;>A1"SDT5LRY-FE; M2J]:XN+O+K!YO]S4-.A)N9#6W;4^IIZQ/5*7A6KS3P'<3.V;-GY-*9/35K7N MM$6\XQ1+*CGLF?WBS:;8H'VQO"P)=U$;VC9<\UDCM35W7-ZY%(+;INV=/8?5 MK".U!N[H+H$[P/TX'7 #N(6@1IA=YN0ZG6&E[G6,MQ,,+>?G3\&TX%HM2)5 M/$LIP)LS3'MK'FE_Y[C/V.IYRG<9DA+D'G)CCTG7@T?_=E[VE[**M6'" MW6AX!6X::3G6V#SB+F/GJ$.IX:P&=U+[ESOF[<1HN$.J%&Y=YS?KPHV[%7M) MQ,[<2N5*+7)ZAOE+$7.#N$N[_V'E[!#-E=JV,FQ?=_$+%!OH=F%>BH%AL&@+9C1LGSM!QCR/ ME=G2%VDD3(!:VEJMX9)%NX\@(*9X=\N!,RO7;H'D)=&N7\L\MLY1/)-\;MUP ML8$D4Y^.!2>;"VSN=FY$U)#$O1N%*4)4M>"(2F1W(OZJ 5?+=$H(,]T.X@MD MK(7<=K)V3+WFR,W][&);1'P^$5Q*]>C:EAV:MMPZ:T&E).]A-R(TY*W@MNCI MNB/>A.-=:=U,3QRJJSRG>,&SS-+OM,);]3O63E_S9S??H,Z3=\&[>KU9\]LY MOA'>WM/-M]]T\NWKKGLKI8]L#^_"]ZY;(XWX?LU0O(6;^N/F[K?YSUDA+F9S MO.>T=^^/=]Z;Q,T6FWO+M$O>UUIC]T8:)Z:M)0/P0K& 4(0U[[!+;(0G9?[- ML)-F81K^78^,GH1":%O?AKVU-[,$ ^"QN=WITCFR;;/.32?)D+J.ZOVXAFL% MCX*.^=85&LN,T$?-\ZWL3.C=1.YC0AFV96J_;4E8#1)%'U9#\N;F4$JV##E6 M9I5\F!-#B%V ZP*7LVEZY^C+9\FBL"P;E*V,]DR+G_G;XNB=V'^;\CU(';VA M&'?9P5C5])'-EXW7VZ5>WM;29^S9=P,5ZHDD%7S[-K.F06U9]S5+[VWK;G5_ M4Z?-*7"\]PJ\PL7P+GYGPUK5PN[CZH-[*B7ZWDC;8HG1U[$8-Y2Z IT$=Z+F MLHW@C.:#]Q@;TYFZ=LN2P/-Z.6J[;&HL^!WVBFK7O6C@+G!,8ZB1X58CUN"U MP"O>'&Y(XPS8F2W\SNC6M!7??3J"JN3V\9WZCF8E=3]?5&UO;/6Z\[UC9*%ULIEW(=9\BOYW9O5FZ=\/;2"WB7H/O<]O@F]V.U^W;F"T&/Z"* MNDW%PBPP.!K\!>ZG\WAWP4VZDO!0MPEW@8$T6-Q2\):W5UGPK MC&#,X#SS\?78/@U6Q@.PS?AF%R5N",\"E<+YV5; MCCVY&^@PG:7;(E[GW-R]B=O7W#PP;&K!RX8?WT#M;/<:T M[9+0MD_;N,"N)IL:=X7_F*O:%'&3V&<<\ZT7 X%SNA'%F_'!V$"\%;?XMGB3 M4 GC(_'9P$_[U3P9C%X!3:=V G6KJX_>TD-DCT M083)]D9_,(ARI.Q]'E%BP/_@3B^E)\'[@6IUC7N',I?CC]O0>$C\&(L0GWB[ ML4W>,? /)G4<0PX9MX5/O#OB1N6>.&UF8EV@7"(N(FRP-OP"H5#<09[;#(KOQ5_DK]4UZ$1<17[N+.W:%%WD*,Q;ZHW9$+Y[E4E? MUUK?^E51XPD8,0]PX97/SM#?D:_)C)PR\0S[A'3'R MP(G?^%3W,PNT%.XA/X$KS)@DP7%5HY:\%6Y(5:::K2FG0^?AS(8H1/N/\5FA M,]+4!^+',)A6XMFBNG_;R5 &TKGB"W;I;6,6IZ#5.X#/$PT)UNX2JJ*M)';M M#)I\S*TG,K][#,M9Z#EO==5*&,<22[6;:"ID<8]+B>=6-+8@\:@:EXVU8D=.+M1![K[I7#RP7?SG"GU(1L-<= M3WD:[-Q5N:_M0$ZJ!MRAJCV9!>^7,D1UXVT39Q]W6FF=FSK2F59S[DFH;9$* MWAZ[L-KV,:+Y&5Y,K91-.U$\N>#KZ3M:TOCREI$OW&*["VZ?;-+R]QI1%;[R M?"FY?F;9KIEWN+DT7^42I!&JI\^I+%)[C%VY7<4-S9=21?.Q)EIUM&LW3X1N MHY;@/?-NYS&,('8>IWT3LH;1J]W+\PW<:"XF%Y).I%750KS(-^/-[K6]5IRR MPPW'E[I=;2F+;%XX98W]K)%WAF*F+@OTF*KKW("OKR_C5F;B*[Q-)$Y-Y9PS M25MCGW.O&UE*44R]GF95SN6SB+VV>41W-+9GO(&GSQKG0=VJ&.0<"R[!W*A& M((%P464ZIN'9QW:;_7")R_'-K[&]%^&<+RXM91'?S?MA2'/D^=0\-)YGQ)L' MJUO*0_!TM&_5JMELQNSBIL6F.VO7>>K\QA,[)V1:9L#F8CT\,2;7='ZJ19W# MSYN^K=SY^8_: PT_K]SZ(&75M'.HGNT\ MSFG,9VQ"YJGZ^CHF+IQCR*'GA7+):;-[^-$9O3W/4T#;W1E$-)'#"@,!G!"X M1TE,Q9\F-^_@Z^WDSJUD+\D7,UJ=P*DD8XXN@$\?J/(&"H##5KSJZD*Q!C$8 M5XB(T0>W\MPA@3V>GE>^8P2M_)0B&B%VZ7'T[ES/^JS199V.#YX*2WU"9PG9 M]W2?)5=^4(SFY12 .?81IK,YV\:G4#W8TW8[92>>P"[([8@ZKHC2BKLH$%]< M.2&D636*I@63<<]C6)=-!2Z,*7N@J "BN'N6 :1@4A:D[A^V&WHRZ-+MD&]=T!"U@[C/NSP^U_?/ =]5:E98U5YW+ MSTGA3_/Z>50V4%M++WI!F_]A+>J>=(915 8&GZ7[>')B"O0!.O-55_J+*J5; M;GKMZ\?*U)'[ 9SJ6FM\1J*4SF+,P6P!G3 M$^SCQV15]L9,ES#7@B(_L%*(^[26A9J1JDA(\#YH;[0,3TZE2!MA,)&8U2I) M%ZNYU^'\=66U42WSY&QU>T<;H5D!079R)(=*;B"L0LX&5@B]S1=JHCU90:A\ MJ%$3JR6C!HG@UIP8=6"KI]IY7*%-444;#J-EZ(XY_ VYIW91?VB3NWNR8&)M4JZI4J-XET7I??1]MGUVJ]::\VR2U5W;HG5S&L(.@;/-!;6([YV MU6-Y_G)T:CT\UKAW$JM_S\*I?4Y+'H++C;=6!Y=W:MOJ*V^X.B,OK/[*&ZMS M,AF9.]10>N;[:RW*A$#**&?$3>@I=V8Y#6KPLJIOB,7,\]G%^9":?"UV=E^4%=S?S3(ES_7\ D+G+M:6)#= 6LJAVL64.!E#A#-[:E1 MK]>\L'LU3U'#5(]ZNNN"6VC7!ZU[/8+O M:GVWC6)'ZO>US2P!'79:H ^@42]99U3UICY,-9;=;,C.K?YH+$>W MR,'I$.X?.#+JJLU )RH?=E_>/7)I^&6&QZY7]['KR&GLV68=XT#UJDU@W\KV MQC%A,4QK^:.[Y1W'E++?C67L1'5P9T!ZR8S4%8T'O>KA?_%+'I(]QSR==HF# MTXOL878%N6@ZQS[8#82/V8'2Z>,;>XP]RBXPA[%7F#UWZ.O69D'7;)[JKDN] MEAO=JYI4#UK[OO-NE6_H;JL3VBE@_*+F MOK->$7:\[L..TBYUT^D1V,6>!O8-.]^MPWY,"V^"V/6HA&Y7M)<7E?J,Q5ES MQNG/B.*P.5C=/:=B]\66KP=FU-V\]#IV+YTH)RO-'S1JQ*Z()WS;#J&_HT:* M;+7?;FIH,0F[8JXSA[4MLFVF[U[')#T29*.LHK;&D[]O=P.@\\#A=M&7%%?S MBVG-95V>6X\8\FI,YF6HTY/)CNWCB:0)HA:"R%>*..$T.>X\Y?;+,O)&J2CS M2_T3#0X%P/KBSX%_W15S'R%'85$_-0T##U5MI5;E9NRU^QJY>($<5^ZU:,L) MV^&,>7$$N6<\3BOKQH%^BA6Z979,:#=\43R:-E)WP1/M&GEGQN.>-;8IR-_Z.W*?7)?<>W<>]&E[6=J!CT%7>0&;2.!/3DL?4]4H' MRR_02SW-N);]T)TM![)?OOIZ$.2M]AB\<:<&';.#N7=UY%@WN%;Z&[O<#;MK*_UI5'-/BL72Y!;SK.$1RUMIMS :K:?@MUM,J'-<*GMPW'C_ MQ/7.ZK8UL=A=,MYV5^D>RRWNDML*N827V!Q!=H#"B;6D4&IUKF6$*SH@366W MTYOM]VT^*5<$/,%&45-T.4/E"BT1B\!]G/V5"5N>:;%[%_.9N0H;JI7$N%)A MAH[>E.&IST/Y5 D36,!M$%I_FXC$9%\Y8VL,)Y2#2G>;\O+,=W*71*X/\Y\[W@9QS'??-38N^7X5TX43 MKT$SQ/=G>9I<,LY."P) A;2*L:JRD>H=7]Q^H/XX(!H\ :)893GP,-*K&GM.0 M28L.X4M@EP'#NZS_2C'X5V:1SSG,W-=C9'(ZU68/Z!/N"9$_"0*%#^+ EAX/LE1\"AP_!1^!Z G0$LB+4SR*\33 ME0$U,X'L0$:J-[47/ECTA8$(?^'X0<\O]C.GN%@8AFL__I_$\-*CV^?\.3_: MLXM &5>3,DQ4@FPW"9F-HR MXW$TAH-5R0M#FVU:Z#$L*KO;+G-?3LP13J/MIJSN/&:C<7AUH?TZ%K&##^?5MT+:BJ;H<$/38LA7 M.>7H9MM0#F![6^60![B;$JJZBI450S*Z)+\Y M.>1]#Q$ORAT,40V@\/F">F*JA%;NU-+RE(<#]8L@7>*&E8N: MX[L3D-:PZ+ZV!W+/XC$ 5Q Q4'G?W*Z7++D4F8O^)P83,P<]@!X@4)1EC&)]8$"@7XY/#1YTX=(\!A@,8+9J--R0&(CY+AMY PJ>,T/_@ M5[[QD5ZZ.&F^#TMH)2Y90^.99@$%Y[^868PWJJ-W-N**B*49PT+#3$H=*2.4 M ?,>:\"0@57\Z;&935!%.X#':YSI!TM>5\D^F,V7A+,_VT+DB#J>-E^O-HNR MY9DJ(S/#P76RE+RZ,EG2Y:D@Y;'QC9(%M;T@?8+5$\@05H2T$OW*9G+U,39. M>PNF=Z5$S7>>F_E05Q^,X&.&5E;_C(! *50=/CHAWIL>@BJ56YMWL^@'P>"$ M ?,CT@ZHY+3J$:5.B8Q\ 5'9F>1U.C[%E #+(*X4F[P6J>S0@EJ)07 :"#[8 MBBL89IJ6@;L8'']4LR'G,WCQ"Q4H\F=^GJ)4Z5PU?C#SA&UO(5.>0 1V]#%H MYJ/RVD2?M>D!JYM_73WX7Y(F7>>;H\DH,8]&_M>B,(*G" ?#LK,1M]78+-)3 M-O:J"FK--7. %!3#F&*\$6)\"^,GF.&%[F$E>1TE"306=XTV9'?"(MP0^/;R MG] W%I$+>",P$@@:=PBW <'0("$"$ *,E001^_>=>5U-Y6HD9*T" MU7MG5_+O9G^5SQ@]FP[VG@9GTR0DU)2P43^#&C J"BE(C$(H'D<1AGHHO[,% MC]F1A&N934&-KH*+G,[''P$65.0%.#6OFY?)8)0CU5YN)2:%0,;&,YN*-/>> M"D(TCBKV K25MDR!*8!M]\ M+8OU2Q;DWVJ;_,* "K?7T'(^:.B_Z_UFM6BL9RR<:X0']S'CBD^M^CPU#@A= M+BK!_QNR9-CJ7]%W@.7L)$TN;.,&1E&X8CH,M;Q?/^LB,W5'FL3]%G;6ZZO' MJL-XZ/<1.:HQ4+=I5E)WDZ[N?LYX]'/3\,BZ6[H#@VGM67;VJ<3NFNI&-#=# M8PGVG%J#/:%]Y5OZLH0[V7'N@:?=&#MMYJVLMGD/T738 <_.!_("7:W?TQZD MMA((W> R<'&FNHR^B3[?BV%3\E( C0?]M((VNT(K#.".HTA""%_@L*6NML@9 M6Z#$>,"XMA%9QQ$]'J+E8[L/3,ZX=>@&N/B/[;TPX0D&>&M2\"38<'UQ1EP? MZ6/'O79\]1]E ;BP/5,_MWR>]_HIP&&;Y&')(=LCB6/S7>Q:=K_.I7UK/TZC M,".AN&XOIF]6AIFT]G!%W0'VM;MH:8U=Y[JQQ_HZR_S$Q7!&88Y1O]IJ%;[K MZ%+?M[4PG3ZZ;_J6CC^CR>/24EX;]>CV^=JOKZ9[ONCJIW.[O4J\6NJN/$S4 M!+QY5&(/!1FY\B"CAS]:OV5J#?F_O&(^_OABJ0?;L%$)=TVQ'+ C8*"DG8<, M) 0$QLI30;(26HD0)F^?2;H)$KA?:/*/Z&VOBB?7+)C;QA\JS?")O#*EY5X2 MZ9_)[&^M?;DAL"4-^DLLEXG++$_C\N DS_LMD2S>-?WR/_KQ?2%$"$\9D3@_ M':(+YR".I3+(F[QQ[&>^"I:70BMA2,G(\1!WQ:X[RD,"J0A3/9)L\%(FP4F60?5O-1+40X#<.$0<#&?61(B7[>\.XVR6+IL?1PGSZ- M(3D:(5C@Y\":]1+%)4E1.FK>H"ZN%F&S98!O78/EEGL:'Y4B_L9\9,&^^Q]H M?Z;090F58<0&Z,FY7U.\-K>=7L979Z=6(KJWKSJ,4.)@T93YVRW;1IN7JGF M%-6>0MV6.S>\5$QJQE&Z-!'Y?I5?)O33L0C>5F8:Z5%M:+Z4_.$E-X18VLOK M5/KRK1?\B2Y_)41::5R:,_ G\7AVM2$_C$_(A[C?X.CVE$R<>UI6E(:^SGC] M](ZKFMK=I.71,Q8I7N4VVWJ$GGP>Z9I\#'>4Q>2_SU_1H?M%7%/&H1NQKT=S MGE6EH:CTL_I=E2<8EYY^,3UQ&%:"9D.%KL*4;Z)P43;F3R;Q/2XY#U%9R8-E MBWM\%]CAYY71@("T3]N;14G&Z^72Q%]UQVIN%2EC<]?5RE J/N]8YE>O9JK< MM9PJ&RU+2A' E(*VAU3C\G,K61&,_HW ,N)(D4(_\K'YCU38>%H,K/V373(K M@Z6D+>IO?F37DE9\'>=G\JM0Y?S=><%^9HTOJW3/=FU1['PYW2B_PCT^\ZGR M9-6S4M2"ZFN9J6[/QS:[\F%>C*E8_D[_2GZX'^N3]5?**EUM_K&[4X^$V=>' M.[UC6M1(WBE=DK\W#T'Z]O;V"?LL5S^:RSN+GM$YO$^=^U-L&H@9M$:,/I:7 M54W,AF)XONI^)C;/)UY[>0/VK?SS.46/).VC#KIC\I3L//T(S&"I3BH9M*7YV2IA[3)=S'?F7_C#Y4.I(:$:W M?F =A0)),M+L !$2( Z4M )#9&3=28Q/3O5%.1+0"]HT+#Z%.S\E9QX?ENU/ MGV[Z-O4DN%*L-;YGE^Z^NI^S>_UH( T;]R/UNBN&GG=E-@?^S?MDJ\XAYT_ M2[OOE;.DOBE=&B:,):Q'XYSZH?'@_?@ZJC^6%9L#H%VE:CS\OK(\AWHJ[3,V M]N.G5/VOWGX_,D/>5[W.N0O'KUI-OEA_4!P10[JSXEQ?\[!/?C+U'^TX]:H/ M:_UP F]2J_:?>YYG^#/[ WXJ'>+^SI[6_SQ->5V-#F:B:UH?!DU4O=," M\W+2M.AI6#H?]LQW-^P?>;/O@F(2I+Q-?%)=@9<>>VR:)+.I5&Y.9+!]D,IX;L76$BZ"?T$]<PCZDRSXS]XG*%6?7,UH_M;#!F MEL5VZ7T&Z-ZNC=EIU$5UV&MC)3H3$M>S"(5A9>V' =6R*^E5&Z-G_"LEST*)Y?R(246)[,$@* M_)<7\AE3"G.CBS]2^Q4_G>Y"^NZ; O2(GDP1L?$*WPZ:LW2D<]4G=N- NI$$B:Q ML6C^GT]-)O"WM=J-HRW/-U>; 7NC_G(URK)I%.5KZD7^T7'9_;K-Y-^\WC97 M[*8D]M64M'X0J+C&M.4GV*95;IQ%_LF C1];(6%K11\8H%%R#7'JD_*(*BS/2=9"ZH,/W/A1P63MC:UX.)V,\G2&KU%AB((_T1=W MY>00$3"/E<5%]WC3<%<;,0@:Z4R=D_]^M>_( $>:499'(8&A5K,/2H7N.%GA M-@(#XT?[/)H^H:-RYO,/-E=!LO+9B9)UK%1(X6L#)<8)-"Q"M@A-AB[-][V_ MMX5\3'H^8MU_YG'Q-Z%(^]MMZ5,4ZE>ZYZ^/?O1[.*U>>WT;^N\//OC[ M,F?_SE-@&[)F^U[@/TB?4N/A8[9:E"#+3B?LA^FRI(NK$U0:M1%SF_Y&#;/% M_Z7ZY7]:+ R\15=['JG1OX=H90G]:BI:QV.F!X5>K!-5C25,@ M>H(1$( H<]6O5I,E:\(]<+]E<;4=89:'\+9=)_ M?R[>2>1NT76V2] BV4I_2MM*!Q6862@PXDCB8D].!DOL;LQ<02RG+I1K9WO3 M?(U8^!*9?FM.-TO[;8-Z_4\G8(T=/1YR1&PITE^?9J. EU]^.&& 3F#17RYW MN12I@*& $EWX15)>M#HY59%ORF!&73YU-F"8,T5@A '+7_$RTE^E1KJ AS=, M59LU4EY_'AUIWWU0@+B )G X8#M9,G]"&/!_674I742 EEW/:8)B#&0S:1A= M^E,59LB *2Z*'9%;.1Y:=_IUDG.21XAC-% 18#Q@*AYK/=04G5_"'FY4MU0O M2FTZ4SI3*0Y@KX"F.X-"HS.M@+DTKQVH@*4XRAB\7[@=26JL'KX4HA@#'M!? MQ13]?\0C TY"4Z,34T?]6JLAK4I. ?UQ_M'^< M@+5^HW1>=\Z 2U[7="TOT8!L.[6 (UTC1J1C3E7L?Z1S4'V5>G]3Y5GO?WES MCC>..\0QUX"@7=([B'.X7UN "3?I@"9V5D]/<#%JL6_F<]=QMT'$;CQP(%(: M=/145VDN59I\8FMQ5/E_6VX!50H]9E0C7GQ4[8!&:$]V"B^]6@PC,665<,)J M3X O@:(UG2=2@*1&JE^?- -&V'-I<*TH?$[O9L)SN%8[@554V3@\@<$P*6^1 M8BE5QG(Y0D.!XVB71Z(QA%H_?7H[?G!+@:@W7&E+=7\]6W#2@ %S?($B=ZLP MH4^'6M!:C#,-9HUV*X%U<-LT8('P9\ARMG +:=E^(6Y9/(LWKG'T?S]>9%"( M-9QVU#5B;MMK/E(?54"!WWVK5"EO2( :+A(Q)$3J=A);;AFV4+-W((!Y&WH^ M.CY0>LP;-#DR"%DS8$O3&5I1DVPE= 53$%J6/DT5)Q5N#D13K7?+9_9Z[U#$ M@;%1BFBJ!5UD3"I1'8 */H#R*L$#=DE2.;1WAVAY>1TS;G%D2:-3, 4J"?D> ME0J_+M>!]40>8VXR\BF?'()8_'LC%ND,XT?\:4T3M15Z%R +VW_B8K%_4B?@ M?UD1-7WV!T" @H&K6MQK'H$_64I"1("\6'$X1H F:!%=JRC=:8&]<\MI,'_O@'(]1E+K5;LX9$SRQ538'.:?M<1'#V@,!SVU<]?GE[*7'H$K M=XJ! GZ<8NE_ %WS,BF!P#PK@8=&D3 7@M& =4QD@?Q]2676@/-R'8)L@:)H M>![Q8_)]DC"C@;UI]W_>6?& XGPA@;!V67VZ='^! X+*1%-^^Q!/!^Q;,0>V M=WE2A H^4^XQ2WQ1:%Y.G2[E:2V E42W#]M=JF2>#AT'A!;Z C9$@2(\,C8^ MA&UA='UK !VX9I$HE8#N7.@YA'K"8+UHP#U43&5-N4E#*<YA3RQS&0!)8C/\9#,X,V3+(%P$NPZ39HT_#6'H#+ I)QKG#,#Y,$+0"N==0;]3C^=R #> SN-,M+0UM*;WA@3BQ)/P1<4F<]9[8? M$8LP#_ET::EEXC5C#0GPB1@&:@-9\HX+]3WE[!'ME=:IK"GO\155E2'W8 M@C=4S7ZG-,Y^:C:Y?H1U@7V/?85<044B+DEIR7\%+C&# 4=%@$L\ZCC'95X3 M:B7@*+UC]6IM$6TT;F4)%+1F*62]%I!T"X%K?G\1M7\Q9K]L1H.E=BQ5NV@W M&+\R42F8>YQ\C',V:D!UOFC*?[@T15(L:Y!"88)Y=YH\6UE^3$2#:'*L1(E, M"':X?XQP)']^>WM3.$SI3N%IKGVF'RD%NB(,=XHJ4D8+9?P+PA)X/L)M:V91X&W7 2F "P.9@GHNPDR\!U<$ TH8@/F!JWH3 M>-%J77\G ?$9#PR;?NIU7H,]&4$\1%+=+,4T]C"Y?II]BR?Q.7IUJSIP-B=R MK%L?1@5H9H$B12-W8"E/@/E<4'XM:>PY=7!":==QPS3B?E!I*$IC9H\Z1H,4 M:0A4!H& \-_IDX_:+(O3G.P:+IS9G(((\ATG52/./)- M05+"<%%MI#'=@T=UH71L@4]^WG1_;XLRR&"Q.I\9YH,M@ELO<7?3.X@Q88/( M,H&!\(-V3D@ZPUT%._2#M3#.@\$TA6.Z?NE9FEBE=!5=OT0H54A4%H2H9P1Q MBF<'A&MRY8+)<,0\(%6*6AIV83;F@X9;WD"Q6B)=&(1O4["![X/C?QR$^6.\ M3C)E7G#/<=8H&E4X.J4WH$X$'BB$$E#_@]LQ5VLE:%-NCCIP645HV(!;7-$45#8VA# >SW-I/6\\TVFI+R"$QCN$ M;DN$4SRW7<,XOEA2A(.!LFA+*5>$5GT].UJ$1H"@/(9F7H1M:3B$\19+9<1^ M/81M=6F$164:A$.$ASRO5AZ$O5OT@TF SS8BA$9^G7[!1N@5O"''"TB"?47*92H#9C3^3K)C\&D^ \=]WQ,O+40*9S % M82(XZ!";&DLFW@2J#E8"/#YV23EA1'026X(^5EWB#4-Z^W3 9>)E^!3A'CEA M'DOT>3078"5] \=U/GQ-9_ W4Q##!UQH]'=C&;5"A$EA%WT8]Q3Q&R5KT#TG M4\R!^GYW?SIYI8.F44=$##8B.$(45&?/*UXSNWGS%:I%6P(T/MQZT7HC:[!L M!%A>)GEL 8(;A%5NB"QOA T[<83+,/:##%6'/76$87*L75"$"X26D3I]A&J$HE: A-YKA4PTA"^%MCC#,B5FEUS5:9(]$F;N,!6$,G>N@N R M65,1-$I1*QL(A?!QST=^)0IE$VR?"J=]^!,Y>RHW03/9:%Y^BP8[>8L*)B,! M>H-^6GC[A*PFQ1^4%E]7I!7E>V-QI=.H5-.L-8;G9R/#L>!X$.% -]\Q1.7$>% M-S+V$T04Z7;68N%$7P.D%(15^(+UA+IW)385#"E+BB[B;E8GA@[P93Y3\F65 M1=!H#0QZ#8\H%!V* B: ( \-25 S"Q"I"(B">6R3"/5KBWEW>$\P285U$1H! M@72W@>E/%7HK$00^:"?X$]I)CB #'(UT)X.B@G-[T7WB=W-P0VE%.WU&]7]L M/9E-^IGL\/<]8X87V=;Y[C7M)66IUWFF>=0=QV#*O5W@>>EU59IA; M#VY6?PIL(GF_=@IJ0WI7+45AC(.Z!(%-SWH2A;>!VW\ 7MP?$X7'@Q4\S7=/ M/-E;\ T!\D]%D=Z*#,PT..X;@ 481>A4A#TJ&E0/N3T"&W5#_@=D8V#W*%N,;%(75%JAQ73H? M?T\[IFC]4^-7D"<;:$YR$GOY-M2"T(-3@'.%D!Z!@18([T].&%B&JGU&ABX+ M?71>!$N&4()M;]"#0E^//5HQ4(&?91Y[:SC7*+]@OW3??&V&CGOE? 9T?6[L M)-9M/ &" 20'1C!C9+!_)WW)@8EEZUS^%T04!P@[@NJ"\0/_@=(.+DW910J! MN0ND%*UF6 3_@0<5/7F&?$."X@FD%%Z&L7 B?AYR45>'.I,LODD*AC!RK&"N M99-O&$R25!J&,W_N+OMF\N?ALZ%#%6.($L&%9'%:5>IVU5:LTJ M4B>R7ED*4CF."F]^W%U_(^4@=$OH85&%-2/' 9R&4 19AOV$#GU(%#L78D5Q M,CR&4!3D9:!1B&HH'68J21>@+3]=@!7PO<+=\YXT?_@>\\&VH\AO6&?(8#7O U@3&Q4F(Z2')2-LES9CI- M'*%CV%A359(S,CNY1D\$B5DZ$S!ZK@+3*FQ%:&<%'/N!NUX;-^]BN!]'/]-> MOWCL@FAY]!C">IX#J N)>==X-Q37>H!KD!@5?\@B27F>@T$3;1QE$ %YM&9Z M1?-"SFBP%B@C)_Q'[(<+5@QUEV=RLED[F\2>#YCBW+-4RTJ-6[N.F@13&("/+EFKG]38G8,%W#0 M@H*!MFI"<7UO:H>8-VLIDFX+@C(Z,X&V6I9=C(:?>\A4G'.39Z(U=H$\==M; M*3P05I1":D]ZA\5;K'Q,.JEJ?X3K63)W7RENA[F'LDG-:T%K$89J.'5U@%U9 M4(.%[U="A+%PTG%J1&B'+S%99<94-8&=3K!GWFNG6*>'37-J@B%IJX<53*E; MKH=-?R->O&KP-G]RGDZTAS\Z0#&QA[*'F51-=7R'O(1C((4K;T]I $Z@?2MLA7FY'YEIPBVY@Z8)*SXOA\H$ M,8<^AY<2F%%((0I]2'I] X/?D,B&1A4RAZT1]? M'R=6&'R\>O5$,TYB GI(_ +B!Q8A0P1F TP851)60#X#;$#M:F)^A3:Z!-AE M#P-\!W@$_7FJ [DJY7K-A;$%@4WX 6 ;7RK3@<9]UWN+=]-6H1%_ E8$XSHS M$\MCUT@$"$H_YAF)'!B ,IW7D$69B"+2!J)>H@!A2Y=RH=,7BN'!4BG0]?B.A0IV$!#Y)-/41D MB.H!9HB%.3XU+8ABY-67X6$5IQ80\W M#&8;1AK\3!=?^V[.@F2'!881<7YWMX>0A')3SWN=-9T9QE)>.I0WL7O>@+B& M!V;:./R#AUVP/*!VDD["B$1UQ(99:Q9> 6:17$=V4%+$7(UFDW7.>S-7+78# M+D)] X+L?X,I>&QY=%=^]"C3AKLA.7P/8Y*"*#"G \\-4D9I(8)T 8::AYP# MZHBW@?EZXG]R7>UUZGV3/'N'F&52?Y0R?UU3@C@\OW1#6;,\*X7]?34[Q(BL M5+M=I#)%=R!=OS4U6<=)6G!:3,9-O%0Z2,Z(CEV+7'-$L5S9$O7:( MB.U*)^XBM@1<\-(G8 M;="A^A8F>9<=<1(.(B2>"7'-_.U=54G>16\N(?H,3>SUMTXW4A4NZ#?X*% M@\AHNV5JB=1_>"C*&:M]A&E9APY770J6*]0#BC:"$V%(80$S0\@IQ#D]1,H0 M"AR9-ELC> )R*@(X' I$>I9K!C#K8GY*/"4" 6%D.PXZ46%./%/8*TP_"G<9 M>/YJ7(-L,[.(*W)0=M-]!W3:3FV">8?&+^YH>GTHB=@[85/0A_^'OUS9P]5=X?.B=!= X1Z+,Z)Q3OG?8USUHEQ=KE=?%G&:6$[27_QAYV)4V5:*=N( M@SPN@CI]+7$\<3Q05&G-AZ2)VHD]@QN*D(0[;:J)97U-=KB(KHG.6&>#Z4%[ MB5.$=5K"?U)F:82J7XRE+BF0O_7P;9D4Q[6,L;QZ)MTS, M:5\W6XD<565V<'U"@$QVI69=B3R"DX7^.Y6%9(D+A8$MBX-'A6L)ITJ02,+^!6P8PU6'S'DM;<$Z=A[QR34RR?(%[266'4$0\0W< ?@$Q73?+,@%^=GTP:>Y4 MAH' 6GY99F8>ECC(8Y97U<#6G1:Q!^J#I\4X@R M #&DAPM>CH&)17%:@91'NG%,?B!^9&WF@ATC;GTE.]"*Q7O2BD9QU(IRB0]IV"S8B@>+ MP#3T-G]9\8">1,5=*WX-=+U$!T:>=",[FC(T?CQEB' .B1!42%68?;@XS( K MA?(V57U<5(=BBV+#>VMP*UGL<\-K+6:S-?R*9#N^:16&(W["6HDQ HN#?:I; M&RA7-[QQ@G9B=L:)#GZ@5 .$QRQJ55I]4X _+XN!&EVK840 M>ECO2:9RL4<<0V%'7X?Y/=!B2E8P2]XWCQSI;I&+\P_F:O1Y#$D$"%$Y?46N M&Q: '*Q*3J&T 2LAMQGLU&D>B^&J6P(*Y04JXK!90\,.'S)@I8CR9]LF3)@55&MX&2?TH"20+1-T5C; 3O#,7O1G MBV.Z:@]^.FBB.JPR^7P7?OQUX(K(AI%.]8?'+\HLP7XB73\XHG0(:.* N6@P M@O6*^H@FA/R XXH\/NED83.RBQDSBE4YB ;$=%?,4EQ8N[A903+1_S#GA .'ER-!X'45S)%BXTND=CATM-S8I? M@Q4>^C97/?-\U53/<%UW)%T&,1P\@UW+AL%_>'#6*"B&MTG8?9\W!HFE?+9P MM89"+A]0AHN[B,M[*(3>:;-?XG3X9.H<[WHPAOUD['3I@FTTZPNX4%HUHV&7 M:C1G%5@X1-9,A"&-!LY& V%X*@]G !H+>E$-"WQ*2>,-_$SB7" %F1]>8)^ M<1<$>KE*?F5B#!XP* H+,$P0N77B88> 7$I) H,2AA/, 25S\EK$);Q((FQO M2EE'#8"\A&")^TJ2;(!I[VF-C)U385$C>9Y('0\/>I@5^!!N&7\+&P\.>J5Y MO ^M;-L?!WH,A\%WQX#U:#G0V?+Y,WEK>AHP6 MNWK[/HT/;PHQ3S9;_E#^*K,%<%%%;KJ+WSFZ#/0.B@^V"&LA&O?A4)PWVIB^H,>@]O#*4+WH:E?MD-,@2295*2SABBI U6BY,. @Z8H.^.S-01X&F5'>,M6 %!% 8!IX8$"(X/G!@TG/IN&*6T]C:"& M/XTN 1"-@$Y(B_4S#8F0-7-I[8?=.UA+UFM39K@ZE7K!AF=5A#A%+EYRW84* MABPZ5XV+B^M^IV9T#NB"0F=GC2>,8$[]!I,_/TE<(?=&^#QV25%OC2"C/IT+ M&HCL6^L'K"W>!W@/]A-4A10!/H*'%/-M"R$X;N%'RU8P!X=M&!=F8 4!Y(1H M&L05S )O%Q,M%ASB*-I[22+S28$M)%?E@8L*? -'&\I&97PA1Y^&C@=T#Q1_ MJQ<*=]J-EA"E N$H.-'CJ4>N2-%XVY,QXH3U1\3I=ZXE6Y,'Q,V3,5 M:>*)XU6N5:EPPQCIC4$O;6+>->2-5E-!*/>-EDPN@;\[_HWB@SD8>85S0D0D MC%Q0=3X<&BA15$>!RG(T) 6.4'?SC:QE'3$[?FE/CGH5.YIUGT_TC?2+AWT6 MCIHS4&57.F,I"XZ\,6DW_8V(>IV$O%UX3VM!J(9E6@-8(&87%AF]2((;EVPY,\,/&!C!C6).:WR3" (H M.F(:&>T$C 3@C7,7-'N]"5\MBV7.">Y*[X1S%VT1U!>5$'1A&WAX*&Q'(1E= MCBX5WHW;8E:.38X";*U3^1_'"W=>: EV/RQA=UY\C58*(8-/>-L^*Q$S81A7 MX">;"-4?2A8\1"9YR(I$A98,7BI%( :%#(A;/H\B%F>T2QAG%8&1!H-XL %( M8?X^"0"'>&8HB7@3"P0_C'A1808!-@"0> L_DGCX!)1X66&7>!,_7F$P IMX M&3\=!1L_>@8*/S( ]0&B>/I0[2MJ8:6.M#"@H /%+D1\\ M1*B.1WC;(I)-?%+T!X1I>F&'@WQAC I^8; )@&&*>/$*N7FU>&4!CFV*2<%( M+'J*8>PX<$D[?"\9DXYN&4:)W> J!3>5IF6T !,H5N1$0@!4$[HZ^1VH/ MN6'5.6A=2PQ7*AXB:0]%)ADAX1^>!W4<9(D!$.H?8U' 3( <1#02,<0F@[E M:?,LFP_.)>D?W3]^(>5B5Q&*(B>F$!4VJF/K>LM0?8S!CCM)M1QH/[(VLFT42^1%,T3* M!")L=@^Z?=<@SRI+2B%)1H\6$1:/]"5]"M%E984! S0JZ'KJ EIQOB"M#L8K MB2OF>IU@@@&'*V&/C8P%C;T6@"8A2K=D=8_2A4"/+P"/>/QEMCN>B0)^6E-( M3'HI45=EAK!,IQF(C^&"LTZ%CTR GTR#CTA])$3]&[N""AW* EXC+HP;+:YD MP"IM'PH#G!&=!% G"00F"Z,39WR4%/0/MV269"*/,(\$&AU2.2%R$.MA\@E\ M'?4$@WEQ%Z"/'"5*%#H#HQ/,#9\?/$3;(K%A#@\\6/\8I TM *2/'SBWCV0_ MP"I=CW./X3^K=QAE9 FK4[J,1!-8",]E9U@=3FA*@!^P>B

@<[$46B3GMU[(VG34(N_S6" M0G0Q_S6U%&F0C!ZZ*#6.VB1"CD$I;X)#?Y1CY195D#IU3Y -D"N05Y!62TJ0 M39!9D$I!Q"Q(D-XU@I GD!R0<(/)D'60D)"M:XUB M1)"]5;EICS,:)*V0#E2GD&U/JDVSD/)UOQA0D)N024\?.MM;=I"YD,Y57#JQ M@QIH9Y,.Z ?"@J=>V)!W*.=,[03-&<8@ BN'?R%+#'RM M LJ0X1CM)_8&]G9#-!M6D!,.&,!3@Q936]QB7@?M7=N086]P:G!1]!5:>EUH MDW)W6&EM\(9_CNY(["^9AI81OG6P$= $DSD%&YT/!H/>3\@E,70>,&(/] ]8 M79T372*!?_$\JP'">2TJ2!^%.2%*RFAP>WX_KC;>*C4 YPU0(W8':4KD2C(U M.WK71SUZFA!>"))^"&(I8^J!HH4T%;Z*$0[AC<0<;$!?12=+30XM&H,BXVI; M#AYYR8]?*@4$&TZH9$91 I!R2/9KY@5O%YH+D&"FB\]A94L.OCS, KX_]$0>0*8_28;./Q M4"($!3RW[6^MY 3#D M(-D@OP6<2X,*[075$T]$.A/"(&8&YTB:C[&*BB6F&FPMAW3O1O1'X43P>=I& M2A:-(;]A60J4:8R1V&Z1-0&9D2\.#7A."LMAF8@_$Z\0^A($3]P_D!A2JIMFQ9!"2$E<5[:$,J1 M+A%;*Q<-61=H5RMM8@20;8THY!["=?]YHI';)PL4CRA+$<-ZOF4+'*@6>(YG M&> )2"9- '@7029( N,9/Y'E'A$I:!FE?JL"@1LE;-I,N2MV8+R#ZB82$A!_ M_(]E8_Z/WAA, #]8P!/Z;$0)YF7;5NL>;%O\D2Q$\6"3(GL0IU<%5E6+L#46 MCIE/Z"00BP-6*H[^0/A-FC53+^%5#D4HDG.0B$+/0#E?QE660C22D#.0>KH8 M_TWW-?Q5/9+!,]P6]$WN-84USB0HDKTX1I(%1_.-1$*0D+Q^BWHJ?Y\D>B1A M3U!"DB20=7.0'B>5,YMZO36*=GF'W!89(Y0W=C>69F"![#1H31L&Y1[X;%R& M3R#T!WI7$!QU(M&+:P-$,T4&:GD4*?MYZX%]1^=$>@_@&NM@WEIJ1P<5(I)& M&T@ME@/U*MY"Q"FF7@0$8$KK7M-+'E?P%+P/L@LE.;H"B!.1:=!'](1AC7\' M_%[!*A!AEDG(&\Y'7QFYLRR6'%>,;U40_6"0EUV57 M>2)A@TF6(0L47Q3 D1XF'DY:'6Q\D0DV%W,5LS=B2ZU9VFHL@&T5&P+ZC$!Z MF88O1-?#T,)""'; M2>]W/P2((10'FI*V;3)]7PYH/J5]I"WT/:X"5!TC)I!%#@^?DK8)-QU1'2\# M& L/,Y<2%&M' ?,&M465 NR,3AWQD@A?^"2#"@]?^I*]?>@^%%_0H\&@BYA$ Z2$X@M>6!_&!A2%X$E)U.R)A\*EBHS%E]+)8S(?5<< MYEPC,ET_<$CU6@459R$^H8,GN<%G@*2 K- M81(-OY*1'X1E&Y-O >D)M$H@%::1!1RLAFJ-+0VQ!9LYMF2[@A63CA=A(?AK M*U:Q!?MIAF ^2L(6%"%:?S-[G"T $2A[S(MN#@<9S0-\CKX9*DZX'\,?3 *F M=UA\;A$&;$0:;0'?.:\+WY))DSR3M!;]3]4C14,+)PTGM"1# $:#FWHRD$UU MI4\B)+>05I($CE&0NDX7D#2#8)!S*>4S92D(-'\SF'N(DY S)I"2-3*02D)[ MDY\UCY/*&GB0SB2/D[,C#D0G*$4 N$V^D+:(<8R- M-:V30U#46X*3QDD*,YXS<$24D HT^2T+D,"&BI"K32:0II/?),X8-9*P:<>3 M.5<1:4Z263SV:$ MD"1[0?02UL.)1<6@SMO'GH837-'G0-B&]0372NP :,)*"J\ 4( MB &?'R47')2-2;..JPR.2HA*2EI*&/ET3HZS+3TD7023!%>.DA_* 2) N@4K ME"@70P OE(08,I1B,VYZM!&.L78',D@.5MI-'N/;I-Q7,.2)HB;>>0^LF.%;*%'BW^Y X<) M/27-1K1BPXP !$\)6V"T#'E)\RJP$Y,2-I-5*F07Q3J[C?='E!0(3_0H. MB,T99R#R \H,R 5X%^DO9WHNAO()+'@V/G$7XD;-DC]OB'\V>2V'VPV8!]9G MWWF1C%T=VQB7?LL<$9(D*8:2FPY*)QH+=2BI@WH)9E%=1KED_@GSA$,_"0N< M:["4^$_Z3[T2$9UGB-.&%J'0=;S2"LF55G.B4DE4 M(&_7?8F+?Y6:C*2ZA3_819 MCFX.!3+\!P.209.O(_$X/Q*_@0=)!PJW*F$!=/%' M2!5H/A ;^@3T,65ZQ#JKC/(,NPDG*TMAYXQ641)\SP>V*[4C[V^U9+XW31'3 M*HIDX4=/-7$A.P,'(@]?=1#"%FP/>BI!>[^%0&>6!R(&$74 6]N.QVAU$U)&TDJA MBUH<&BW\;^&-?!":B,\?TI*XD4V'+F$($0J41PWF/@:6G0U--2U-J1<["1>6 M2 K;E?='?8[>A%4=AAP:&(=T^E*11%IBE8-M0'MM/F2CD6D1=A5>;_16^C\@ M%V< 0$ (>&Y7DWX46PAX>@HZB-$'^V$*(,U/\(PA26M>?VO4 :8%D0ZM D 6 M50$S#&$ /#(M ]IV]8[J/))A6PXSEC\?Z1QFE0P<4Y9-"V>%C0A+# "'!T_V M>\Q'$1TC'2T%S5[K7APF %OV3X=@SWP7$K@C9A-+*Y^2+Y.J M1A=Q_G4"($ M$H,'#L)*HE$Q%<@ECPF:(*.#PP4+D?5=[QG\&6)*P$?:1RLL;"##/U- [8;% M-W!@!PE)%)5R%]@1))<CP,/$2.7 I<_ MD0D:X):V ]E>9XZ85P8?F90<7[.6996?$JQ)>E^Y'N-?EQV^7Z<>;!Z\'0Y@ MK("&'K Q#$AM'OJ $DB[@."+3E\+;M8=W8!RE:4LOH!*8,\=>V/*7Y^ 4& I M7]E?5I?B7TM(/E]TE[]?4QX4;X0=QAXY:4%(7)6T)U)?QA[J@ I(8)5U]EE^U7P5^3'BM@55\W2(5?V!V$ M?7)?J!TO?KM?4Y>W6*8=BI<=CD=?-E_=-GR7PG%)8"\>/5^Z@"-@HSIP7^0= M0$WY?LY=ME[\=IAXZ'BU?;YN9=/B<\RM5]#<)MSO)>=EZDQW%]_ M'ED[+U]96?M?<)>H7RA(EAXR7\67CBS\';^7\#*"ER]?65_Q7ZH>>E_-EW1? MEU_6E\1?I!X92*: VY=['BA^YAU0*;*7 QY0:[9?RU]D'G<>FDZ;EX^7B)?" M7QQ@<1ZZ7]Z7J1TT2%F7<5]77T8>V3!D7RI@ZY>^@ 1@;HQ12%670DB\<&1> MDY=6E\J)68*37PY(#IC;';EL6A[\E^*7-3OR7^9?E1Y>'M9?-E]F'F27;!ZI M?-$>GH!E'OUUIH _=0PZCU^(ES!?0770,P28@%]=7Z<=V1Y=7V>7\)>'H.7FW4^F-6",(%4E[$=)I!'F+L=88:U'J&7:#9+ M8!M[7%\Q8&=?PATC8+!;Z9=5F#M?1%\U8!&8&4A&C;XS IC=ET8VRE*L@+^' MM9 #6 AF$59MU]/.[Q?&F"REQ-@N!YYEYB7RC@/'DQ?#V"$7\\H.$@D MF"-IQQW1'IJ7.%_.DY>7))APER1>EY<_'H68=I=H*8B8N5\RF"E(NX"Y'A5@ MQAV;-2&8)E]*F'Z"FXW_D]>-=V%K*Y0JZ988%_UXI!6Y( J*6Y/_*J(*;W$7 METT+!A]$ET&79XZ<+1=CE9)%A;4+BB- ESN7$B4!9W$G!QDUEZ-@#9-( MO""%2W43DQ()#1)\R44)5^H4[$**(_TH*IK%\H2#:8J9==F*)?UH4)-\6 "AZFEX*7 M4'(Z2,F7*AZ%F/R'HRA4'O!?+&([8.> $F!/'KP=63&Y'5%@?9@HAAH>!![^ MF%M5XQV'+X%?_Y<7;Y >Q8"@EUN8LC*$F,X>1%\I8 5@($C[F"0HSAWF'?^8 M,Q[TE[L=LBB/EV&77%]J@A^9ZXM-F+@>;9=1C9H9EYBR'HA==51PF#U(FQU+ M2)B7N)<3F()?YY?R@/>7])A,'I(S"9CYE\-KKI<]F7HI04ABF#68UQT/'C>8 MRY=2EYN7CIB_ES\>3)EVE]]?3DB\EXF8S9<.'O8=0)G@E[R71YG?7T69$IE; MF=R7GH"F'JA=!"-+7SU]PAVQ'IQ?HAYJ;BZ9"1X0:&$>AY@/8+@RS2@$@8&8 M#QXM2)4>?1X&=#V9&V!,A!.8[I>$F%$>\!WJF$P>9E_%'C!()G<%@81=-IG4 M@%*8!IDJ2 -S&D8=2$!>?Y@K3(B9BG5]F01@^9?O7U:90YF"'M94FQT9F2*8 M$7*F'=.).YB=F0U()FY7ER:8VS9OF&68LADSF%-(C1V5F.5?TQT[F*@>1U\ M'F%S)9A5'J27:SHF2$*8$9DEF.N#T5+O'?@=3)B,-ZX>]WVEF4F8XIB?,8"8 M:H:P'4J985\6F55?FB_KE\M?NI?!F1-B$#<4F169B6_Y9ZDT#)E-F%B8MR=8 MEZ,9=%_QF#V8 TB\;+4H!6#HF768D!U5F70LYH!G7TQ@36"!E[.97IG/'4I@ M,)F%>QI@.YG>'8$ZE1GPF%)@?X.X@#*9<9AWF;,SJY=PF8\>8I<_'C.9)E\: MF.27\IBD'D"828$:-_\3Q)9! T][Q S'!T,0-6]JEG<#MYC* ^9<#9,8(F44 M2RUXE'P&_2]I,"DKD#ZM%B&:SC\YE_50M9;B3TV7O9B]EJ26G@'3$J\3,V[8 ME:B4WHWL%QJ7-YK3!1@8>@_I#[=C&X.KF.P71)?J7D6:AEZ[8=-&Y%XX/NE@ MS6W#F.L>$"M#0.I$Q$PY(U)BF M.>='(6U2 9=-[5V[F N63Y;E;,U/=WKB=3J:59:)&NL+BTHT(E<,70DN(IL% MMV3.)V(2K4A+#$V..IHG$-1G[);S44%6,@ X(:MCPTM\ 4T ) LFAL)J8K+ M)S, _B\+E@(8XB5- -"!W"U!)^\,GYKG/.(E4S*[@K>8RT] EAU)G1H*;7!( MXG5U$/L7CR 9@5X9G&V2$GJ6%).21'FIHG M$+D#+)JJFKU]40JF"L0:@RB/*T263P?>2H4K2R=X"D 6Y %,ECPRC 1E9Y>. MZCRP SP"$007 E +V9I1EOQ1D1]ZFA:7W6>\.9P-43)7 3,&F UX"@>7!'BP M"DB!';0UH&>\!R@=.)\I/9P:(4;LYTD='CX"2D!1V#Y4;(6W8=19M$IN=$DZ: M/)= B!V;?%>%$KQ\&ES8>*:8.YL_&CB&SI'5>SE;4(Q9#WQK9BV^*I\)TR5: M5@"%6PYE)?L_F$L5EQ^-4"'_"/QBWXT$FS\$F910FPL0I!7)#@$: E>-(3F; MKYC( <20K&(84=@16)NJDEJ;<5[2#A1Y\2GW2 8&47$@DK4+KR$=F_D\/0EB M+0D$E0=WFQA72RQ0#RPTSWD@ *=3VA")@,DY+(?: @&2*T2_!;@;FP=N-59H M7 S4 3DI&8BF=]9'9@%]F[V%'67!=0DM<%N>!WV;[Y0)DCP& Q69DHN(:#[C M>86 "Y(G$XD,6Y2U45 ']GE32FN;ZQ)[8&DA)QJ()5X$ I?ID%81NQ#+'+$' ME"UF1ZF5,E:LE9B2!A,K'>%6W)1&-5D_W)6 >%>#^XZS2_>5B2#_CE@?91UF M%+64( KFOXOG&MY'4&;ZGEQ7N"8Y%\8F>Q?69C(7VN9_&?N7UF9=)C F>^7 M^9G0E\ >TQX'FA*:AE\/FN";2IB6F,^7 &!(F>.7GH"8F'>9^)OBFVM?%)KJ MFR]?FID!G/B U5_YFY8>V70G'I^9^YGWEUN9*%[K'9H=[%\#G*9<#AZT'B52 M_9MGN[7Q628XX>F@*P=ZH 5'C1?GQ[CF3R!)V \7OU? ME%^PF2F9VAU'F#V<'IPTF(^8WYOUFYQ?7IEG*0:<69AI@?*9G)E@F&M?8ICU M7P^<1)A$5?J;.E]4G*!P0)CXFP!@W)?OFTZ<8ICWFS^96U\AG(<> MA9F]7S:<9)DUF5-?SIDO8 9((YPYF1V84!YK7V"<^U_4EQ"9HE].G(&<))QH MG"L>+YS<+(B<_YOS7\,=Y%\;(^>;5IS%@)"G&H>]U^$=O> EYRWEYE? )Q;7FV<:IRQ7S"]9PMF"D>GHJ#E]^Z<'9D58(Z9 M$9FEG%&9-9U0'G:< MCIQHG/Z;1IW5'F6<7YDZ8 V99)DLG$:=!YR0*?^<[IG5]53%)G>>;1YUA@JQH*E]3G7B9 M6V5HG?N7>9T-G?F9?IU"G%)@/$AJG4><3YP>G?N'$E1XG76=TUM*G'JMM8*1=M M$1>6LYV:%@]?M8\&!%IB'#4;(I<(4GQ/6*Y%R4\\!55) 2$@0&4S^ U= KD+ MTF\##:V=33-=>_B53U@Q/YY+G03& N,12DK-8:HK[X0&EFU ]X8$"W,!^5(/ M%]2=%P32+0]?6$GX!V@ ^@=%CW4AU9T3!ZJ,*T1%9(% J@UL ;7H24-7NI+I](+7P&3SXF^0] ->@" M= Q)#1:>\%YUFOUA>%C'#@2>+RH/ FM>('5 .<2*+QE]CEI%)1$]/ED=(AJ] M!@V6OGCF,225]1<2*2P6GSC7""3I5+D( Z;SO6-2>&G2C\-9,PR)ZN/$\9Q9ZY M++V3!4>LAXTXWD'007@O[)/.)+Z> $(>)RUQJY.6++*3!S??GF(]XYY/B>6> M:X'Z9F5@%A?@8D=L'1!*2?5.@YYD=H(NB![0T%%L.6:>Y!6%9)P-P9)_2 %*2Q.I?PD/ MGIZ7=T";C)0!!JM>@!2$:>"-*VVG*PD<,G-]*)MW($W0 @9U8!&12W -/ WE M'B2?:TKXGF^;?19FG@@1RT?O G@("0MHGJ$1Q%[47F0^"AEI(!=\"DOI!7P/ M-)\E(: 2\H:;7G,'@@@Y1U)%X@T$*V$=0I]C1=H:7X^8'/X3?1;M4'T"8B#9 M76>>H ]6CC,', %*0$1Z= 3""&6>4HXL$Q0(#QQ,&"DA#A\:3D0!!!@GP1:215;GZDM% SD9/!N\VMO M6!,K9I[E7(TY,2;#3-65'S:N7CLPS2>5><)\_!1PGM\HMPQ-#HTY?HXZ$2Z: M;D#R1\4NIPFJ>"T -A$4 2D!2S=QG^9E?7A'-!PX?9\ MIY4\!EZ3!1&KGNXV\8HZ+N(T5HK,,M%3!"_=C"Z$ZXN=8]95G3TECJ1&I"A: MB5V5I6,38M.?DITW?P4CQ%9N,0@[U5+9>*R?]3AS%BT50I_OD@V%!1_8$_)) MW@\'D$5-*9NH!Z@+.%C,DA@7GQ?37C&;70S$+OD\<#3+GZ@6S6@6&GF;.61 MB!6?J)[2##L1 J $.*Y3U%X+:RHW&(_<"U)&*P?<%T\)^9I (,(64Y^Y>04! MW!>,!9E2*R$?2;LWAQ)PGD!/8B0YM3 :J?161A#3\_5B'Q-<24& MXWC-'&\P009(H%N48 G2-V\9YQZ;%NA/N#8'"F@J5!?-E?Y@*&,%DMY:@!*> M$Y 4+)//9 A/L A4%PD,D0CG'BT#@VQG:G43+7QF(LJ?%)X8&&H6Z0$* EI; MQ(,_*S$#?)_42)4'#:",E&Q;)033!#ED:33U*B$6+CD)G]-,4PCH#"Z>! B, M4:U^ IMH-&:>!A";44,!?Z TH"T',QV@$V8,?@E?,B\B@*!(A4\'8W%>C\\?,9MQ M5E)6E@?N!<5%9"(_5K"=P8\8&&$M3 _O 1Q\VF"W&>V."D\F(_D!;WDV1]1> MZ27Z'W2>J!:!6[='^CB#C%\S0IY;#IF4G9%6)^4#+P ME-\M\0$J9#&;L1+I-U5:0P&]C;B6^Y 2$[B6=5?,%O>@>E>G(\L0OIWV(91+ MY F#2A08%ACMCM2Y80K$4\24H33@!/ %0 T4HEDZX"I9XP7%%Q^<#3A%3&7:@<(6A Q&EDD191+B=N8;4 07 ]6$!HI)-?@?:30&$/\T M! C!A:Y(,Y-!"9N+_'2.%_(3.IJM(M>6@!I4,M07_ECL>8$M[&%G6M@1=U=O M2>R?P5$;6->4Q05.% .@;1&#H !G\A/T'BD'U5S9&!I*1"W1!T*42&RPF-Y) MAI)+$Q:/ 5\DDPE;K@+* >R="0]!DU>A[!\,=?(33RT_6O!(!J"\ 0A/KY)] MH7^A^GAB5SEBV@)OE&2._P+*H;@'>E9_ YZA89JU=QZ6>"C\- MP49/YD<<, M;*&\=7.A>):DGE:>>)KV/14KEDFC*\%V?@Y*H$>(71W%CYR@&5?+5NT#)0CQ M;/='\VQ=>1B5,S-G#LU0[I(E K@$QGTFC"Q'J#\'(O,9/'A*2@L#^(Z]')F4[:"#,.L73)JJ"G<2;0"2%.51NPV6 \*A M^E+'A!X^9"WI*/"A$P?RH4!T?Q/\'W<-%6UX FN>4 >Q)5<8O83J9+$*, HP MB+!_X7D]3]IM5T[#+O=(HP\!2Y^8C2IM9Q\*Q% (E[TEJV8>@\% M ?I'U(]->;QB%T_-D(LH89YWD?QQF(?>&$, ,**B8&8A=1)XHJ4J>J+)%G^? M, $,H;)V$NA(9#,L(WHK\0Q>H,I'59_C M7I0-=F!@:!QY+40)#7>/MW@XAX #&PE#FEQG09?G,= FO)(9!I04Z**Z$C:; MC9] (C$+7"UZ4=='AJ*:GV@_"1H"'PJ%"A[%1P[ M!)X2HV Y!7@'<72X0G=2NAEN>*^(-P5%11N7"Z/F7@\@47SOHC.:Z:+BEG1[ MQI/G-='D#V00SBID#^%%UA, M,U.#'*-?*KT2ZZ*[DEL724?>F.IAY1\4#E :]Z)Y5PEBB*+[HE8'_:(L 0@? M0WB,H)V"EYL&%S<16 ]S?^\8C7>!9*05=)OY;-UB0V\KF[$&C0=4>&RBS4R% M:-I6A:+<1P:CSTK#>F<+X5!THM)0R@B4:7X5MD@3H_H&%:-$FL)C&*/$#!(= M-IKIHED2FJ*>*6QUMYYJ/8"C/D8)+X2C2U"%H[&B?'>EHFN5BZ-ME;^BF97F M9U&5WY]0E8>C4VY@A $WBGNKB9%['7!SA30\-*,H3NMVX4^(5^FBY4\K'Y]( M.Z,9HRMM3)=<9TP18C2]$O)0L$)$HPAB+1S9 >A/2P)*HZ(F_Z+GD &C7@,# MH_]1[P=4HU J,'EN%UT16J/Z6J%7?43&!\Z%-S[RCL#WRH^BC\Z/374^52FV(HX25*JX";(_\"0:;F'D.H%8LO98*D0M8\I4J*MLZWIUX J&.NA*! MH3].@&I[#0R4A16L")-@.*3V#E:4#UFH"W,6=PUEFL*5S#^G"G%HQ)6I2U%. M#C")4JI'> C49-YN7Z$$81ISGZLE4PR"HH119&C/HP]7B0@V MEP41])+5$YA^ZH^#:756U%Z48%VD> FO(1:;=1;PH@.>*P=Z44LKZ05WGSD* M&0UTI$]O97_X%0E)$I\:GPJCYY11?.TG;*3/HM.6A%&DHQU?@1AE:K 3+7QQ MGA@#]'2R$FLY_68S6WF?MP48HY$Y5 G_.%"#MVUJ"N"-IR'+'_U[]:$X(PJ? M%)ZG(<-*(WKB=6U_6F^\)9A%N0M$>AACBG]NF@%)Q$RDBZ2* @PD%]DRYD_P+8D<89):!:# ]C)PT MM A58^:.^@*>&Z45/I>9TK=EF=\Y<@I MI=H>0A[WFX&9"IB(G5*7QYQ5F'P>G)GZ'?>9]IPNG3:9V%OKFRJ=KVHAG(:9 M;)B=G&F9KFM6G0&=1DA@G5R=R;#9P> MG)RCIYSD+)"<"1)/I: S5J4X&*F5_FEIPG%67*(7JG#^8 ME7MAI6"78*52I8Z<29E=G&Z'9Z48BPR=#IGUG)@U=*5QF "= IR#G6^E,*5\ MI0><4:50F5@>!IQ)I5%?1Z7DG-><3X0TF<. @J6I-2JE(UXWI?R795_B7SZE MVE@WI?J7:9V(EZ6:<):675-[K"%\ _"BOZ5D ,6/B@0_EV48BE>W>:F+FPQE&!A-U2G% M4[$I0U%>"'@9#IO9$U6?]J0&GNAM,0=7!$I6UZ$V0Z6D2P\"/BL+M$4E6[9D M5H[!G[:A BG'7EP3+#+.I#*;8QS]CM^=D1\G#=ZE2D48I:(#-%BN)2AL'PD/ M8P,K'P/I'BT.91BE&CBCS*7.I18L"J;-*;ZE%0/!I6ND@'E*&D.19VH/(A I M;S*=-N5@(0.QH9^>7P=\G])>M$4O.?V52WQX)CHUMH-F48 E#93[@LQC/WO= M4&0(U#?Y6SMTA$V95R<0ZPC_ GJCNA(&##, .J8U&S YQ@V$41M'T WS'LEY M(TLK$=NEX159=- $>1U*IH!>!!#N*J%RSJ$ E8\)R!/4!0&E(SDW M?I_F/;@?:%AREBX!1&Q*9YI)7HD36_=7.QU2FK0#9&34 ^$53@ ] %*/?&FS M-Q17%TT'(#NF9)7IHJ8$]0&1IL*EMY8>!ZQDXDA*%D^F'2R<+2E\S%"2FZ>1 M^*"CEMNA'Y3!CB 6IQ>DIB"2S9C]$@!+L"HJ>/I.GU6BIK$*I*9S%Q"EJ*8] MI+HW9I_S4*J2E)9$">8]&Z5&7QVE2*7M,FZE"$ANI:FE?Z6-'4J=**5$G3>9 M@:6(G9J=FY=GG$F9FUQ=G)BE;INI=JF M]*8%IRFG'*<7IRNG,*>Y@$B92Z6]F9>E2:4BG8^E.*7DF#>9I767F9G+ILT= MR:;(<,>F4DC%IM>*?*4SHU!J=4HD6ZMA-2;1?[>EB(/Q1Q 0D1^!38X"$:6- M(:$0>1TMFDBCPP@?']8@1P;30B&(+!E^!?L_DPXWEDD82*$Q/^0-0"SQ;2X1 M P:5"R8,7W_B"T,)?HAH 'EZ\0,X$F91%TU IF0T@*2\ TX E3:L%WI1A0:7 MI%4+'33)>39#+1_63X^GZQ3^/9:GD::4IZ8$0:9V#Y>F/J;LE"JB\@^9IO:: MD!2EGCV/!I>5 H2F56Q"/LI&%V%P&ET_J0&$ P)A$0/G+P1A6@'K1/ &G*=( MIB00+2HNGHUH:P MC18381<)<%U:9PNU$CP& M:2UI6')A%J:LI]TO:B6,I+:G126XI] KL)K7$KH.RRW;I^BGZVQ41X,*F1 < M(+]GZ%!K2(%SPI>9$ZB9!+=NE9EH&9Y80T 2E :"F<*1G MEFQ;=FHD!3BC%AIW&!T?

Z3]GP>@P4\>GXY$YHFQ+1&2(7B@E8,? MB:2#IO"G51KDI,TMA&V041Q; *A"! *H4I9&3B6-D& D%[FFMZ;SE7JD.Y2G M6:>F>)2*H'FAT(U3 G=;,ER_+JB6R:41!!:;_0>*H4.&I!6=4?QL)I0JH&8! M=@F)H(9>N*9^J"@72Y>.E!,IUVGJ9RGI4FG^*8P MG9V==W87F*D>GYU(G,J7 M;)GH@)2EDIGBG/V;-Z?NIN.;.*4RI5J<_J8MIT^9M:C,J%"E09BGJ-"H&Z>+ MF">=2)A5I2BG"Q(LIUFEVJ@7'D&="J?57]F(,VE,I6*E;W-0G2R" AZ?G)&8 MYW/EJ&NE#:<8G*BHS:AP*5"=9:61&?2F(ZHV9>#I3BG YHP$N>FKE_"J+8R/J>]J".E1:7LET6G MV7Y*F?J#"IAJ4ED,9HQEYN1A(2M:.1'\FD,1E*H5R(]!A8E-@BSP0 9^A/ MM8S.A#RIR:2%%*@4H1NR1>UD*SG@W9N=@*:EGJC2 MG!EWR:9BG8RI?F\ J3!?AQU^G9.I]:;L'96IE*E.G)BIWYN:J4JE%'X@G-Q? MOZ@8F2*=AZ4E'NN;A:7K@"6I2Z4(F46G&9RTJ&^84J4ZI]1:<)P[I7N+%:E= MF6V80*4H7SFGX9N5I4NG Z>9J9>IP:G J<.IFZG!J3^G:YC[J NG(:IU2EQ*GD7V67;*4=G+)2]:CKA\NIX8NZHM>HCU\,IQFGXJA=+M.HQYSZ MID!(%*<$IQ^G0!P]G=R"]:C.J-*IPJG%J=&IX*GQJ1V<\*F(I>J<&IWCJ2BI MN*DUG9*E'X*YJ;2IPCNWJ.-?DYWOIIRIW)FLJ:H>(JE7G8.EI:E=G*>IZ9DP M8 FJ,9U?'C<8!:<:J?6I[JGSJ7NE&JJ_J1BJ\JD>JC>E+JG_G%FG5J==G8ZI MK:60J=^7NSQ9C2\$3&\4'7U*H6T("MH0I6"9E!2DRZ#**7DP!*813=";^94' M&@V#YZ%',[.GUYHI"$=D?Q*? GIE_@(_ 'X<,QH%,%(!B@=: V8, Y_;'"M# M_SA6@Q6EL5ZM">%'#A6FII$&7:&O#*N825&@/UTJ4I;B)Y"BSIME'/NE#U^I MB/H"34INDZ*&O5ZJF, +, T ,H!,J(2=62F:IZ88*Y9O8VT/AR6C!4V I!L MIQ1%J2(961.."KIFL1ITJKJF#"H93?$#>1R]C9RH!ZEM,>RF-*GA7S*I;)R4 MJD*JGVE/YV=JK"I^I><$8OP?2%@I$XVB2N= )K1@^JH]IB/>^>H=IP]:2*+\(KAJA!%LJKU M(MJJG:K7JA*I ![VJCR8Z9C4JA6ATYREI2&.@IS.JJ" CT^7-P&KKE]B'GZE M^H##JD*8P:JAJD:GWJ:^JKJJE9D2JBV8T:BN MJJRJ3:609YZJ%ZH8J_&J&:LGJR:K*:LEJRNKL:I7G)JJ*)TDI0ZL9!M85ZE+%C D)HG/BB?_" G$).?AY^Y9)-6 M:&NNI["GW*5O4L*AI)ZL42$,-"W<>[V62Q'5)ZI%2A8Z1\H!7ZJ$&1VIR)RJ]2JFZNP MJ22K/*>AJ:BK&ZO7-?&;#*J?J]*AJYVKHJNTJ[.KMJNRJRZE%JO.EX^< M%ZNHJ9.8)Z5IE[>KN)GCJ<*JTJ;2'0:KQJJ0F *KM4[/-G"=_ZK-JO:8_H"E M**^K)FX^G(0!V9QZB4A@K5_W(O.JRZCPJEZ9JT088/"HV*CIJM:ICE]'/.:9 M_JCBJBE^)YWAJSUJXZO!G!14FZN%EYNK]:I(F2)@6YF\F?^9?9W/JEA5SJ;Z MF=)F[H7.JZIT9%!2G9&8Q:I=ES:<39PSI3BGL:L5JP^KKZ@1JRF=N:L4JRRE MNJN@G>"KH*L J;6KN*L;K,*KF*4HU @;96B;FAAELD%WS[2FRU$U$EO$()-(S6P?6":#),!7W2K7Z$X ',/ MAH#^G58A7HE;F]<.CY%(J207W]H@$D,8 :TIJ@.J2L(%_U0U%[] M6.D@#VWH"YF4.IHQ #< L)2'-G1%C*M,I 2@WD03'(FK/ZDJ%X$+%10QH) B M!*6'JNBL1R>&J8I 5)W,EY^J(:J4JTFGC:F5J;Q?TZ;^K-6H)*<%K:^9:IV& MG0RMHQZQ7[F7V9P2K6>MS:@*K3:GE*7AE\=S+*L@G R<'*L]K!VJ"*TJK0^LBYWX MFR>E^:F)G3Y@':0L2(HR13J=@(8K2*%T!9W M@(AN"*WW8\QT9JUCK>FI8:W@F0.M7:W$J FG58NYJ;Z9YFB(G,A<5JT8G16G M5($)K%JE":M$@:&<&ZI!BV-F9ZT5I[=?2JVXF82M;:4DK2NMRJM^G :IO*LO MIU:8=J4>J1"L.ZV/K2FJC)T$G>>KTY=B/3&M?YR8K$BGW*8]I3BM":V1K3>M MFZVIK0^MJZU%K6JM(JVQK<>7LZT]I[6MJ:JOK?2<&*T@IZ9AIW_@)"M4XFBJMBF7Z=_@F> L3>V8PN7F3Z.K$1G M(6V2()80R1M5JY 4-@ V'!(19!+?K:4!"1IHJR8+< 3*X!A&@-A2(Q# _Y0* !7*Y$!0&%6/\JLQ*Q-"_"M9:M5*@(, M:UZ D5NJ!&.)"Q*7#V-"I"::.@''K&"JKR[VI7-*^%)] 4T?L(JJ!=.E,4^D ME,!+]Z4(*VX:.JH?,XEIT9M;#N:AYJV[9HT.^U[^I0@X) S/=0*30P%:DZ0- MLI6^H;@?^0LG,..@"(^5!V$*^'?M!S]O_V!*;K4C,H<_AR=ZQ9(:?' :DPC. M)T ;\98"IK5FAFD4$XP-;!2!;7T6"!"WG8=L9R'D=>D%0J25%!TP:1% HLA] M;F7%#9\"<5 H+2DJ9Z-.5X9[&'@$)]( M61$I 6P K0$D1]$J[Q<$7.R1LPIL@$ZH4 [T8;(/BHC_I'E*901J$'A\(WTA MJ-,%RZ<L"GQ221#>9)P^'I-) 6@)DR"C M!Y((^Y2K']D&$6/T=Z*>VD8%C[6/Y UP#YP&>&3A1"113I/?@8ZKL0@K4^=$ M:58#,G$:>1%F 5@),$-_:0 U])*2$]QNZ4=N#34;,"HW(F\J[0BH86(8IF%P MDG46E0?G"\:*JP>,JMQJ[8ZY BPAQ1G4"0J6!8\)#>0^$Z+H9:Y".0,9$S\5 M>ZQ:#V<*6V)V+81-L0P0'-FGZDD7/A9*"@Q98U2K1%%?%PZO)'.3=_D+3RV? M+4Z&/UP.#U(B^F(=KZH_-0XK0& T 'KQ:2,![DO31)9*>Q>V1>4OHH,@5MN$ MRZ$U&ZX6[B A-.JN;2A6>7VA,*3.C_).]!B\$J0("5*)5&&M2+1\(=8H#J0'=*GBA=WB\'_X-8*P['RF62*K/ MA(L:&:5J8%6:P)HQK^VL81Q3JX@V7B*L%$XC,0 U )ZFR %T#A>B (_UC#X: M20PM@!.>H)[Q1OA+5HY,#_ (>AO%2/R.SYN^'!^CE#I_=V=5QZ)_@32"XZA# ME4*5$J?NA;!5F5HH,5M>3ZT4-[:OI5:VB$Z+['*RKUB"2VUD@R%WK:^>@>JC M(82VK&E__!2$=VMY>10_EM6BCJ\ZC"VOK@*[E((//5BJ"[5C;Z\QH)L. IJ>5@,2& $I[Z52CLUGO0C:5HH.)S2&KXNB M7J%($4TWPD=\D?FOA*^3#?.OXA"[#O./IZY))_I)\@N6KT$MTJ\_$H$J;54Z M ?PA?)N#JK@,Z@:'(A2>4#^?2**O;QFEKV>JM4NHKU%3*SQ@+K5207];=>"? MI*)^=K&O?&\C@9J!$82THB:C+*,8+CA_%8P04!AVW)]2=I WVXK ZNW#W^(20I^* Q/S,EC1HF#%NP M7; ';7X<>["U&A\8!7B%7UVL%HK71&1%9%*>1E!2?I/CB70>I@:OF0+ M8F$!KQI\'<>48ZL-4_BO'RMV$A,0EJ#=8E,G1B64J/D; ;"M 2-EFPC<5M"A MG"U?2P>P+PZ1KQ@=GZ\B $RPT2#:/16PQT_K1J^=ZA+@F+VJ-YQ/2+NM )BT ME[.HH)U-8+VMKJWUF%6G_%\FF2>KIQZE^"PNJF(7VR7 MLC3AL-)?&*F#G.R86Z>_@$E@VQVTG,H=BYS,7[=&$ZS#JS&<%)C-JP&I%JF7 MG1:LY*H0JXZM**>6ESJEG!Y 2()?EI='?M&JOAT2:;!2F3 F8"BI*6"09J* MF)P#JF54>T8FL:T>GV/_L#^=(K$@J1>M+JVHI9VK:9R(I;NP(:D"IQJQ9U]? MER9?S)RWEZ*LCAXV'K>9>J4Q'L29=)VKG,FP#JL;L3"8ZYNLI2>Q&*TDL< = M([$;F"6Q+:LHL3.Q"*O@FRZQ=YPAG5:98;'J:&:QOIPII3:Q&YG&L'.9KE\Z ML0:QGJP>L3VQ%*R$K;6JR:D,K-"9UYD6L:^H1YR)F:&ESI<*L8)\U!+%9'GA?_+ Q$G^7^[#8J/>P]ZL$IW>M-X0I?YT>ZJNF M8K.I\I/JL("MW9R,0O6PSZT0C)BQY+"Z7^Z'_K!^;SF=V)>^JR-=!JQ_F,1= M_ZO3J;-64UG6JX*M=%FDK2RM&)@_I\JP?9A>G0ZQP[%#L3FM4[&]J10> YGU MF^Z%.IQYL36EM*R@'KJP F"J-\ &R8XK/S<(7@?W=R%/- NZ!=@*=F'3KM(W M3P*D9*>(?(@Y>-@86GA?$3P!$@3& 6L IROU99T,2WA#"8ZN&%*K>,D.X0]9 M(["NW8XP,!>O^0%P <8;2EJ5AP^>$@=4 N.QI!Q[ %( AQ3G> \61P*5 KL! ML(I,E L8I (&.(L&2P=D#584Z'3F=CB(P0P&# 8)3@ '!Y5XK0R'54\!5"%U MG_)J*":;!+@,0&?S!-H#0P/E9 UUCZZ#(0059J3R+;\?JR6G/^T]A0ZW#&0K M20K_L0B!R3_HL3 /2 /A =8: Z%-@BL%1H?3#ZR(+2J_K"EUR0K: 3\(W0'_ M$^*Q847EL=N.C2KGL3@_Z;'D/NNQ5*IW">^QV(8$LO.Q8[ O:Q.;( !;\% M^K$;"WJ>+A_S!L0_ +*#'P*R3(Y(106RU*Z*G@NR#Q$-LGL"40H1LBJ>:8X5 MLOH(&@7%4QFR@(QC?L)GJ*(96/[+&&_NQ"0M_%'N@YR^R"T>R/@92 MA3,M2[(>"G9)&5?&>,D*WP;N=S*J7#Z!$O,!X&2")G@H)WCHB4\.]A'8B],J MA3Y,9$D,+Q$=%]X/ %GR-\%0K16["X=5IHRXLBHW38_:/BD%!U-;LATT PX5 M#@H /0>%2K6.^P1L86UAQ 9 ,8&;*;E"I%*N@8) 0,T )$ $4 (0 G M"!T++@!% %4 &073/C(%#;,%#G@ T0)E "$ 4#)L &< >@!R #H"5 !5 "T M" F:!"X !;,A .@(C %U #:&P5"J%BP!%;/1I3,')[,@LRJSY04D G4 :P D M BJSN0A.#-X@(0!O$FX$+@"R BX .;-? E(,/005L^0&" >]CA\%*[/E!@ " M.P+E!C^SL09(LV0?M 44L[F.(0!<81$$^T0R=!H(^#K9'*,!-P"@ >P7LQSI M7B@M_A^( 34 B:HP5I(*_:=Q")<*2@CH"TX < $S!?\5J%B*S)+/K!RZS*;,4LW,"7JPML^<&+[,4LS&S MR0(TLQ.S(0 WL\4)0+-7 CRS/K- LU<1T0E#L\\"4S!I $>S/ ))LYL3:2HA M2TZS=0!0LYV#(0!4LU:SK@OO!H@!5K.9>%]A& 5A89UXOHY?!MZR#S\! L0$ M#R4T$X@!J(ZN'#T_!3_TLJL&]K)A ,0$3P#0"K0*.36=!B ! (& GZS:;(/ M E$%B0)3!5HR(@((!1<"(%$'!9&R/P8Y"9L3\P$H(#E)]@1SJCH -0!>L_PA M1P!- %0 ?BOK97,!+0!) &B4( \ &&S.4F< ?0@- #]LR48+@#/%C, L)3( ML[J.RK.<>&-A/ (^ DL B0E*BVT#0_B+M:S MU(ZTC3ZTP@0T$>&06++T=]Z. *9I"ZN.@V&;!0H6@*CGCH$K"V/A1J)*=(C4 MFN]V]4_G [&,B"'./.N45[)O>UNRQQ*G(B\%4&?X4!\"_"O.H<...6+JDNTK M"9-DC=^292/2*Z,KBPSDL5D*DI)$KFYY8Q')'YLC(Q,_C(.F&:-;2%%G.7C# M%Z::EW=30$9 )7@A@WZ.XZ!DJ^6,ZTS6.@MC$',NCUETWGM@4?!%E8ZD/N"@ M49$GA\,/C ,'"B1Z8Q&O@R22C .UCI_#*JT1(>.CG$?23^2FO@ZBHPH,X,V-XBK;/@4 M::+TA<0EG5$@/XD"YP8XEDH-2A,E:YE3=1+Z'RYAG0%">..(O6?-%0D&>"94 M<966.#[,9<0N:);=-V@_NTLN@-X$I7*_*G8!O'7 =60(8TZ;FZ&:_F$V@/(# M0P35;9 7G2XKLN,'&&2_=RZ#>G$W=\"BM6\&I!5Q J1A:PJD#'[FHP]V095> ME>^C6(K&;WR53Y4=BDRU-(2GHH6!5+6#;[,]\EQI=W9O_*.[GKE7\:/U=5Q0 M396*,6QW(SQHM8Y:^J,ZBF2U\*/?AVQ3W'?-69APVS*F75A97CHN94AU&U1S MM;I8'X[CJCI5X#3=A6IS=K6A-"NC2XF\B()]OB]#:<]W!&GYBHBU(FDI7I.U M+$;_B,@TAHKX@Y-ZP&KPBIRU,VG5C.4D[%F@AX1BOC2 M2.$IK4=A:BUC4^U MA[0TE[7;4W:5PDZPM3=>A#WF?9"UX7RVM3F23W*0,KJU8$R^B8:UI%C9C(&U MO#J#M8UCDDPC58TWL5V#M>V2URFE[8HNUN;7Y?3=KG;7EM5MF MXTZS6!IQW[4_.DMSE+6QM=JUNC'5M6!5;UE5C:&UZ;5Y1HHXZF>_M&U.(7*M;12ISU6@FRM K:XM="U_[72M3Q+^K6?9ONU M-XF,@6=R=;7(B1"VJ[6MM9FU$"3KM9ZU)[;MM8QZ95.BM8FU7W,FMBFVJ+73 M6*JU28 CMMZUYY,=MO^('[9S5#%B&[:UM8^US[4MMNBUW%@SMF6M$[8B9K!; M#K:"M255?;69=&\I#+8J8N=-T&PB:0.VSK73<#%0QK7UC7&U;+4E/6ZUQCA? MM6JUDY5EM0&D-J$O4(MS5U!;MLB&_*-\@GI0SG%:M:-=.Y5TE6ZVPY=0M19> MUG%3M5BUJJ)&E5VUK$PRBV)BQ'-PMF]O(; ?@4JU*8L"B+MV# \H+=EM.8($ M$&$K/$IJ"D\B;0!9+,,Z/D?12R>'E8?4+0F4\P/H)4BIHBWA+ZXMDK;H-P8, M7#XR"[,M80$U #4RO .GMMD^PEU&(*EDFNB+8I+@M4A8O&?UM05E#7@E([_GS34R"C MZ$Y>=G^U_TNBHDY_FXE9BM U@U!SE9)'O#3B6!J)@)6R:RH],W:56*6"T+:C MHEVG96M =H"*X#OAHP"+@E1A56R5G7T_;8),;97@MER$JJ\^CFIPWV/LMGPR MQSLNBV]O9CSNHYR*:I5QE;-H%S?OMAX[<%"5E?"V'70T-7X^/!>WA75FM;:& M)K<&IVVV()"LHI2$'4PT5V.VU+;$,\URGY![BY^0KZ)\.BBA!ST<=X-S*+=W MAQ1W^*-,BS$\TGO@:>6)-#0Z@H.,6T<94[UER&WV/.,1UGG4;7!26GDIEPXJ M2*D(3G&P-UK]9M*24SGR$Q-3\G1/MQH^%PJA5]Z/$GQJ4AQK)"E0EAEG:S-P M?^RRA24R0+T'UDF3(L""*P\7=;0".+(+=:Z(Z0S[(+:NM <)&,N,W'DE#D, M=KO].]-=(8(=C'EP#7&M1NI]Y4ZZ76DQ5',4+R"W #2W MAWNV45+DHXXR=H%=MB1R@'9/M9-0V87-MX"'YWQZ9Y@O=HO(M]U8U)X[E>F# MZZ.58WMB8O&W$G3SMYMWJ7O"*3=M^6W M/97WH^:W3K7UH^&WY[<-N BX'8[BM^VJ;+:S7 .XN[<"N$25MHC33=QQNTW- MM\RW8K7"MM^-=6#,%YK??I%AHT.,9ZW M-;#ER77=OISN*9QQH4GVG.*RWJK=J@NMSU;:OMW-92;C/+!6W.KA) M4A&VH8F +S>XCZ.D3--SY:-37JYVY:,5.I6WVK;3M@%4&W1TMPL#A+=XMP A M2;<^8AV5)(R@35VW%'_S::LV]&KR&PYAMBZ#":4YBTW1EK.8O#>V(T5L;Q+L M"%8;,"R9@ @\)H/?+2=E[(%N,,4:JU-+1B(LD;?E:PJ$NR\RBR>A!3._@"1Q\(M@9D55!+B9 M,;\XCK7SF!^$*8)<@ Y[B:/YMHICKK<3A)&XQN)ZX+Y5+E76VU8 O78\WN;B8?*8G@GWOA;I[LEJB=AWMV^W(^?_Z(6;BSKX.V M2$Q_AB.P2KC4MSI^O3*4N(YO KCD<+&$V+CD?]:X^[;.?VL[ M?"_*3?^X_C# N!"XU8K+-OVXHG,;N;1V4G.@1%6!$H>EN#A%![E./ FY.[ + MN=B3=8GRY(+G+4D"Y7+ADN:ZXG;@16N)QZ MH[CNA]97QC!6N8ZCSUK"N.RXQ+@EBMU;KEUPN:-\D[AON4VU,VM"@T&X>F/) M<(*CZYG9H]H[)U4]@3AHS[@W4-VXYW-V1&V*_8MPXW(#TN&VY:CBLN-1SL%^MN3.XQ'N;E9I'J6P3 M=8V:@S#91UX+R!5HI$:RSZ)"9RDFQ'WO9;FYBBI6(FA(RJY/1*0!DBT@2@Y* M_ G%N2)JA7ZD(?(9H!.\N7=A!F5G!FX'B[ H"3L6?JGIKI-5""(Q87NH+;5G MLI$&.$.J)3,/F0T= XH.>S;,N>]._0+R2U&OSF/$";,(^!#QN7T!=0&85[NV MB7>< [NYSF.N NRYSKFL(M&,1+7^@_0YNJ^0B:"B%X;;?@+Q>'!;H!- AS MAG]FN"PSG7)7>IL'U) KI) FW&=?ELE+EX>@@OV>&N%Q .B>!O7 $?AZZB76'=IBCI#1' M&KK>,:1,0S8> MC(^-YVN^;Y1FOVEGNC6*1%D\A.F'3[K*B92$4KI/?4PV%W;+3DA.,!=3E+>+ 6)08D( MMFN+0(0@BT\VV)]OBHD[XK!A@&&ZWX6=NO"%G[K?B7RZ.(J0M9:ZD7Q^NH^I M.;9@955V;;K)4H&C16BNN29OQU8>?>=^<2?*&5UG0AU\S38K MN_B#B#4!5KPX0CMY=JZZ#[?8<7=0L'&^NOFCLVLQA2Q^?RQE/2^%KX0^N;2X M-52JN7ERZ'SLMV-BIKG#GIJYTW(XN^.+G[@[NT-5.KM"?FR[21F8N%(ZF+E/ MCW&%"RN1>:OSJD!WLV8+C$LLF8:P[K*&(! MAZR?EI]-\TPE4+ M"L6@;I3&(!E&CB7BT?^#@-/IJ4L5/: M9#$1!!P'4_])TQG\:TTC;QE?4E)[M;O<)9843 "/N[L!'KL 7@=)7B), 4M MQKL"NBR+!R['MB2XES25.TAPX#ME7F@\A3S=@CE]6KM'?GAI;(?!+\^V$W?> M8_NV0I"8E:,\NY#]BKH\M'#8NHRU)U):E;DX(+"ONA]IH#6#W.$J#4KI]E8&VN[A]6;2B1+?0MPB&H85/;IV M;#6A*K>\/*Y,+;R?@1=W_K;B:SI]#+F:,;F&1W?QMH*%A(3DMB4[Z;AR;GH\ ML[7N5(-0Q;: 3+=/'63D#2L^? U63F4U>RL'=V4M30ZVNX2:*%.5#!UD*SZZ M>E.\#3S]G1*@J7(.>8^WH3:8:_.ZJ ?UNMN=G0]S->A/(VVBFI@NMKL)3>X8E27E1FY.F;]MTXX1+L!,:$O:+O;MY.C M6KG/>Z4[6+D@M_:+Z[@KO->V6;5TNWJY"[S#N%6UF+>BO+RXW[!VNQ6Y079= M+_^*>8((AO6XH&6G>XV*E[HINTFU%KQDN5E0%*&]O'"5]K;HMM&VZ[9 O+IT M,[=C/*&)8EX7.GQPF83MHQ^ES[P=NHQN?(71O"R[W*.0@$5YCF#O!XO1;SNNU1?TH<O.VXP3O[N]%3S+PU9O.V,[SJMM!S+[P33,&\'KD^*DWV?AR6W0G+7MU"5JU^L9_UC M,EE$4"VP)SPCO,^'9KTZBA^W18O7MQF\!E"4?%-28+4:O+,]'+=B4&^]V)X* MMWUG;'W1&+&[0*_ 6L^5"T"14Z\4)&XN5IX8P%LCC=XQ3]4+&P^V6AJ.? 3 MI@X6BQ!C>Q4CDQ&O*8\HCR\/,VV0; ,@KPX68&>A-,V);V5M2QQ:'4L MO10[ V^W.\H[OG)ABGHO%SO^ARQK@H3?@Z"H';=JC&I,DDSBO7!,[DW-MGPO M9'6//.Z[+I7Q,.V]3%2J/.ZV0W<%OEZ$W+R==A"^@%0#O"6]%X3QC1:^,+GJ MH\=K^XWZO7M,';Z >[D[:8:,7#Q+5G<3._LN&+9*O3.$8XQJC.,VQJ\K73*\ MO%WHO9AB?[LZ?'IKS'AX^X]69U@SNZ3+W+358\?;84 MMG"],W 9;R>%>GW=BYR*EG.E-1B0%':4C2AW DPUH2DQ@+U-.',V,;Q6OC"+ MIFO+AIEP5RX8/'2]CKW)AC:]DJ,VO7&[ICBZ=@VDC0A/!-(B?1A&(\0?KFUM M+:@*,@OC-Y2V]%'$D2MZD4DK$;<0R6>Q/^(^\+R54[DEG@/1*VH*Q+*:H+:G M#;4&M1=2@W0JI#B@BW\VGHY)EA]K8?JR)@7GLWH%_[)]!8*SSP(8!2*SAK.Z M HBS#;,A ^SBK,1LZBSD;,9LQNS';,?LYBS!K.:LR:SHK.=LRNS_0(N *&S ME[,Y!S"S&P*FLS6S%+.JL[VS.K.MLVDJK[.Q!CJSL;/G/T2S'0U&LYYX=0"Y MLTNSO+/>(+^S) -3LTBT5;,2!4H#863YLUNS,P!=LZ !E %1M&.SC IELP^T M(7AH G:S:K-XLQP(0P4# G"S[*X_ 72S9P)ILVP":[-YLQT(>[/] GVS>07& M IN^RP*=OF9\H+[ &VP""[.DOJ:^,0&HOI"SN2Z2LZR^EK,HLSD'F;- 9NS ML[ZZOIZS++.ROKF^J+.ELS.SOKZILQ!-P;X[L\2^OK.PLT*S8@#*OK6S3+3/ MOKNS3;/2OKBS4;.I L&SUK[#LY>^J6#K IAXN8XHM!FT3+3.LY-X1+32LY,$ M^ G5LTMA9+1.8=FS7+3VLF( WK/@LS@U802( >6S_@3]LK\%ZK/Q-PD%-0_N MLP4%\;/F)?.S" 'UL^T'^+,:"&&SWP0T /RS. Z "@@ +0"M.%U!+2Q"@>T MB $*M)8!,P ,M" 6K\8M+R.S;Y?!BVT4@$OM"T!,;3%'(@!L1HV .E>I7@F/ZLW MXK)?#;\%5K1F1K(W)SA CX*ZY28O5ET!R#85OQI]TN"OI\BUK31KHFL&9]> MI 5:^$:IHX0A@;PJ@^\HQSH4>>2T U&G"!M 9S5*HFPY1(?K;*J4;[^=AM== M]R&2'$E;OGC3&ZVV<'']<=2]KEG85AI:0CZ!OO\K(U]PB5]UN#PU52JCVW23 MC3VPBHE#,1=WX'=G3-B3W'Z\4A2.%[SGOW>#^[W8O&]B_3:G1/9-X%5".#,\ M8$S157R05KVD7%-FY(* NWU[6$NO/=*?H#IT@P,S [XAAG,X1HI1 Received: from Think.COM by mail.think.com; Wed, 10 Mar 93 12:37:00 -0500 Received: from cs.uchicago.edu (gargoyle.uchicago.edu) by Early-Bird.Think.COM; Wed, 10 Mar 93 12:36:49 EST Received: by cs.uchicago.edu from synapse (synapse.uchicago.edu) (4.1/2.0) id AA00283; Wed, 10 Mar 93 11:36:30 CST Received: by synapse (NX5.67c/NeXT-2.0) id AA00802; Wed, 10 Mar 93 11:39:15 -0600 Date: Wed, 10 Mar 93 11:39:15 -0600 From: cowan@synapse.uchicago.edu (Jack Cowan) Message-Id: <9303101739.AA00802@synapse> To: nipsbd@systems.caltech.edu Subject: FIRST_CALL_FOR_PAPERS Cc: TheoryNet@ibm.com, ai-ed@sun.com, ailist@kl.sri.com, anneal@cs.ucla.edu, arpanet-bboards@mc.lcs.mit.edu, biomch-l@hearn.BITNET, biotech@umdc.umd.edu, cellular-automata@Think.COM FIRST CALL FOR PAPERS Neural Information Processing Systems -Natural and Synthetic- Monday, November 29 - Thursday, December 2, 1993 Denver, Colorado This is the seventh meeting of an inter-disciplinary conference which brings together neuroscientists, engineers, computer scientists, cognitive scientists, physicists, and mathematicians interested in all aspects of neural processing and computation. There will be an afternoon of tutorial presentations (Nov 29) preceding the regular session and two days of focused workshops will follow at a nearby ski area (Dec 3-4). Major categories and examples of subcategories for paper submissions are the following: NEUROSCIENCE: Studies and Analyses of Neurobiological Systems, Inhibition in cortical circuits, Signals and noise in neural computation, Theoretical Biology and Biophysics. THEORY: Computational Learning Theory, Complexity Theory, Dynamical Systems, Statistical Mechanics, Probability and Statistics, Approximation Theory. IMPLEMENTATION & SIMULATION: VLSI, Optical, Software Simulators, Implementation Languages, Parallel Processor Design and Benchmarks. ALGORITHMS & ARCHITECTURES: Learning Algorithms, Constructive and Pruning Algorithms, Localized Basis Functions, Tree Structured Networks, Performance Comparisons, Recurrent Networks, Combinatorial Optimization, Genetic Algorithms. COGNITIVE SCIENCE & AI: Natural Language, Human Learning and Memory, Perception and Psychophysics, Symbolic Reasoning. VISUAL PROCESSING: Stereopsis, Visual Motion, Recognition, Image Coding and Classification. SPEECH & SIGNAL PROCESSING: Speech Recognition, Coding, and Synthesis, Text-to-Speech, Adaptive Equalization, Nonlinear Noise Removal. CONTROL, NAVIGATION, & PLANNING: Navigation and Planning, Learning Internal Models of the World, Trajectory Planning, Robotic Motor Control, Process Control. APPLICATIONS: Medical Diagnosis or Data Analysis, Financial and Economic Analysis, Timeseries Prediction, Protein Structure Prediction, Music Processing, Expert Systems. Technical Program: Plenary, contributed and poster sessions will be held. There will be no parallel sessions. The full text of presented papers will be published. Submission Procedures: Original research contributions are solicited, and will be carefully refereed. Authors must submit six copies of both a 1000-word (or less) summary and six copies of a separate single-page 50-100 word abstract clearly stating their results postmarked by May 22, 1993 (express mail is not necessary). Accepted abstracts will be published in the conference program. Summaries are for program committee use only. At the bottom of each abstract page and on the first summary page indicate preference for oral or poster presentation and specify one of the above nine broad categories and, if appropriate, sub-categories (For example: Poster, Applications, Expert Systems; Oral, Implementation-Analog VLSI). Include addresses of all authors at the front of the summary and ! the abstract and indicate to whi ch author correspondence should be addressed. Submissions will not be considered that lack category information, separate abstract sheets, the required six copies, author addresses, or are late. Mail Submissions To: Gerry Tesauro The Salk Institute, CNL 10010 North Torrey Pines Rd. La Jolla, CA 92037 Mail For Registration Material To: NIPS*93 Registration NIPS Foundation PO Box 60035 Pasadena, CA 91116-6035 All submitting authors will be sent registration material automatically. Program committee decisions will be sent to the correspondence author only. NIPS*93 Organizing Committee: General Chair, Jack Cowan, University of Chicago; Publications Chair, Joshua Alspector, Bellcore; Publicity Chair, Bartlett Mel, CalTech; Program Chair, Gerry Tesauro, Salk Institute; Treasurer, Rodney Goodman, CalTech; Local Arrangements, Chuck Anderson, Colorado State University; Tutorials Chair, Dave Touretzky, Carnegie-Mellon, Workshop Chair, Mike Mozer, University of Colorado, Government & Corporate Liaison, Lee Giles, NEC Research Institute Inc. DEADLINE FOR SUMMARIES & ABSTRACTS IS MAY 22, 1993 (POSTMARKED) From cellular-automata-request@Think.COM Wed Mar 10 12:58:38 1993 Received: by mail.think.com; Wed, 10 Mar 93 12:58:44 -0500 Return-Path: Received: from Think.COM by mail.think.com; Wed, 10 Mar 93 12:58:38 -0500 Received: from oddjob.uchicago.edu by Early-Bird.Think.COM; Wed, 10 Mar 93 12:58:26 EST Received: from synapse (synapse.uchicago.edu) by oddjob.uchicago.edu Wed, 10 Mar 93 11:42:12 CST Received: by synapse (NX5.67c/NeXT-2.0) id AA00827; Wed, 10 Mar 93 11:43:34 -0600 Date: Wed, 10 Mar 93 11:43:34 -0600 From: cowan@synapse.uchicago.edu (Jack Cowan) Message-Id: <9303101743.AA00827@synapse> To: nipsbd@systems.caltech.edu Subject: FIRST_CALL_FOR_PAPERS Cc: TheoryNet@ibm.com, ai-ed@sun.com, ailist@kl.sri.com, anneal@cs.ucla.edu, arpanet-bboards@mc.lcs.mit.edu, biomch-l%hearn.BITNET@midway.uchicago.edu, biotech@umdc.umd.edu, cellular-automata@Think.COM, connectionists@mailbox.srv.cs.cmu.edu, crtnet%psuvm.BITNET@midway.uchicago.edu, cybsys-l%bingvmb.BITNET@midway.uchicago.edu, dasp-l%csearn.BITNET@midway.uchicago.edu, denny@tss.com, dynsys-l%uncvm1.BITNET@midway.uchicago.edu, human-nets@aramis.rutgers.edu, hypercube@hubcap.clemson.edu, ieee-l@bingvmb.cc.binghamton.edu, image-l%trearn.BITNET@midway.uchicago.edu, info-futures@encore.com, ir-l%uccvma.bitnet@vm1.nodak.edu, issnnet-mlist@park.bu.edu, lantra-l%finhutc.BITNET@midway.uchicago.edu, na@sccm.stanford.edu, neuron@hplabs.hpl.hp.com, nl-kr@cs.rochester.edu, optics-l%taunivm.BITNET@midway.uchicago.edu, para-dap%irlearn.BITNET@midway.uchicago.edu, psyc%pucc.BITNET@midway.uchicago.edu, psycgrad@acadvm1.uottawa.ca, simulation@ufl.edu, soft-eng@mwunix.mitre.org, vision-list@ads.com FIRST CALL FOR PAPERS Neural Information Processing Systems -Natural and Synthetic- Monday, November 29 - Thursday, December 2, 1993 Denver, Colorado This is the seventh meeting of an inter-disciplinary conference which brings together neuroscientists, engineers, computer scientists, cognitive scientists, physicists, and mathematicians interested in all aspects of neural processing and computation. There will be an afternoon of tutorial presentations (Nov 29) preceding the regular session and two days of focused workshops will follow at a nearby ski area (Dec 3-4). Major categories and examples of subcategories for paper submissions are the following: NEUROSCIENCE: Studies and Analyses of Neurobiological Systems, Inhibition in cortical circuits, Signals and noise in neural computation, Theoretical Biology and Biophysics. THEORY: Computational Learning Theory, Complexity Theory, Dynamical Systems, Statistical Mechanics, Probability and Statistics, Approximation Theory. IMPLEMENTATION & SIMULATION: VLSI, Optical, Software Simulators, Implementation Languages, Parallel Processor Design and Benchmarks. ALGORITHMS & ARCHITECTURES: Learning Algorithms, Constructive and Pruning Algorithms, Localized Basis Functions, Tree Structured Networks, Performance Comparisons, Recurrent Networks, Combinatorial Optimization, Genetic Algorithms. COGNITIVE SCIENCE & AI: Natural Language, Human Learning and Memory, Perception and Psychophysics, Symbolic Reasoning. VISUAL PROCESSING: Stereopsis, Visual Motion, Recognition, Image Coding and Classification. SPEECH & SIGNAL PROCESSING: Speech Recognition, Coding, and Synthesis, Text-to-Speech, Adaptive Equalization, Nonlinear Noise Removal. CONTROL, NAVIGATION, & PLANNING: Navigation and Planning, Learning Internal Models of the World, Trajectory Planning, Robotic Motor Control, Process Control. APPLICATIONS: Medical Diagnosis or Data Analysis, Financial and Economic Analysis, Timeseries Prediction, Protein Structure Prediction, Music Processing, Expert Systems. Technical Program: Plenary, contributed and poster sessions will be held. There will be no parallel sessions. The full text of presented papers will be published. Submission Procedures: Original research contributions are solicited, and will be carefully refereed. Authors must submit six copies of both a 1000-word (or less) summary and six copies of a separate single-page 50-100 word abstract clearly stating their results postmarked by May 22, 1993 (express mail is not necessary). Accepted abstracts will be published in the conference program. Summaries are for program committee use only. At the bottom of each abstract page and on the first summary page indicate preference for oral or poster presentation and specify one of the above nine broad categories and, if appropriate, sub-categories (For example: Poster, Applications, Expert Systems; Oral, Implementation-Analog VLSI). Include addresses of all authors at the front of the summary and ! the abstract and indicate to whi ch author correspondence should be addressed. Submissions will not be considered that lack category information, separate abstract sheets, the required six copies, author addresses, or are late. Mail Submissions To: Gerry Tesauro The Salk Institute, CNL 10010 North Torrey Pines Rd. La Jolla, CA 92037 Mail For Registration Material To: NIPS*93 Registration NIPS Foundation PO Box 60035 Pasadena, CA 91116-6035 All submitting authors will be sent registration material automatically. Program committee decisions will be sent to the correspondence author only. NIPS*93 Organizing Committee: General Chair, Jack Cowan, University of Chicago; Publications Chair, Joshua Alspector, Bellcore; Publicity Chair, Bartlett Mel, CalTech; Program Chair, Gerry Tesauro, Salk Institute; Treasurer, Rodney Goodman, CalTech; Local Arrangements, Chuck Anderson, Colorado State University; Tutorials Chair, Dave Touretzky, Carnegie-Mellon, Workshop Chair, Mike Mozer, University of Colorado, Government & Corporate Liaison, Lee Giles, NEC Research Institute Inc. DEADLINE FOR SUMMARIES & ABSTRACTS IS MAY 22, 1993 (POSTMARKED) From cellular-automata-request@Think.COM Thu Mar 11 22:02:01 1993 Received: by mail.think.com; Thu, 11 Mar 93 22:02:03 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Thu, 11 Mar 93 22:02:01 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Thu, 11 Mar 93 22:01:58 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA12486; Thu, 11 Mar 93 21:58:44 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: 11 Mar 93 17:18:00 GMT From: mark_a@cix.compulink.co.uk (Mark Atkinson) Subject: k Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM John Baez writes: >Yes, you can simulate a universal computer with it. But that requires >setting up the computer "just right". One bit error and the whole thing >can (typically) go kaflooey. It's possible that the billiard ball model >supports a more "robust" sort of AL, but right now we haven't a clue. Yes. I would agree here. CA models do have a habit of disintegrating. However, I believe some CA configurations have been built which are resilient to single-cell "mutations", which might hold promise (don't have any references here, sorry). I think the question of scale is important here again: we are used to small CA models, which I believe are more akin to atomic or subatomic structures than to physical objects. Fire a glider at a spaceship and it blows up, but fire an electron at an atom and the same thing happens (metaphorically). The difference is that the physical matter reorganises itself to some degree, whereas the CA just dissolves in a bath of entropy. The matter is reorganised by the various forces present in our universe: nuclear, electromagnetic, gravitational etc. (maybe these are all one). There is no equivalent of this organising influence in current CA models: is anyone out there investigating this? If you treat the QM influence as the missing force, then maybe that was your original point? But I think we need a slightly higher level influence than QM, without all the weirdness. >>I would be interested in hearing more on what the MIT CA group are trying to >>do. Is this directed towards AL or physical simulation? >Physical simulation, read > > Cellular automata machines : a new environment for modeling / Tommaso > Toffoli, Norman Margolus. Cambridge, Mass. : MIT Press, c1987. > Series title: MIT Press series in scientific computation. I read this in '87 when it came out - good book. I like the "End of the Universe", where an "antimatter" contradiction is artifically placed in a CA model and the whole thing just rips apart.... I was looking for something more up-to-date, although my interest is more in the AL side of things these days. >> How are you >>classifying their failure, and has it been shown to be attributable to the >>lack of QM events in the system? >No, it hasn't been shown to be so, I simply said that they feel that might >be the problem. It could easily be that they've overlooked a trick. >Finding such a trick would be quite an achievement. If one tries for >a while one gets a sense of how tricky it is. I guess the CA models are like matter without energy or forces. They have dynamics of a sort, but maybe that's not enough. Time-reversible billiard ball type models are more promising, as they don't suffer the inevitble entropy problems due to continuous loss of information. Our Universe has the same problem - it's only because of the unimaginably low entropy of the early universe that we're here at all. What do we get from the Sun? Energy - no, low entropy - yes. Lifeforms "eat" more to keep their entropy levels down than for energy too (of course this is always at the greater expense of other matter). The other thing these CA models lack is a sphere of influence, to allow phenomena similar to forces - nothing interacts unless it's 1 cell away. Maybe adopting larger neighbourhoods would work, or maybe we need a paradigm shift? Just some ideas..... -=Mark=- ============================================================================= Mark Atkinson mark_a@cix.compulink.co.uk ----------------------------------------------------------------------------- "This statement is true, but you cannot prove it." - Kurt Godel. My opinions are shareware - if you like them, please fax me $25. ============================================================================= From cellular-automata-request@Think.COM Mon Mar 15 15:02:57 1993 Received: by mail.think.com; Mon, 15 Mar 93 15:03:01 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 15 Mar 93 15:02:57 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 15 Mar 93 15:02:53 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA17879; Mon, 15 Mar 93 14:38:33 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Mon, 15 Mar 1993 17:33:56 GMT From: dario@cns.nyu.edu (Dario Ringach) Organization: Center for Neural Science, New York University. Subject: Re: k (Math of CAs - Refs?) Message-Id: Newsgroups: comp.theory.cell-automata References: Sender: ca-request@Think.COM To: ca@Think.COM In article 27628@cix.compulink.co.uk, mark_a@cix.compulink.co.uk (Mark Atkinson) writes: }}John Baez writes: }}>Physical simulation, read }}> }}> Cellular automata machines : a new environment for modeling / Tommaso }}> Toffoli, Norman Margolus. Cambridge, Mass. : MIT Press, c1987. }}> Series title: MIT Press series in scientific computation. }} I also found the book enjoyable... However, I felt that many of the mathematics involved were not discussed. For example, in the discussion of voting rules there are many examples and simulations but nothing is proved at all. I was interested in particular in the ANNEAL rule. It is claimed that boundaries move with "a pull proportional to their curvature". That would mean that ANNEAL is doing curve evolution (curve shrinking) according to the curvature. However, I never found a formal proof for that. Does anyone know of a CA book which stresses mathematical aspects of CAs? Thank you in advance. --- Dario Ringach office: (212) 998-3941 Center for Neural Science home: (212) 727-9346 New York University e-mail: dario@cns.nyu.edu From cellular-automata-request@Think.COM Mon Mar 15 20:03:14 1993 Received: by mail.think.com; Mon, 15 Mar 93 20:03:16 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Mon, 15 Mar 93 20:03:14 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Mon, 15 Mar 93 20:03:08 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA24246; Mon, 15 Mar 93 19:59:22 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Tue, 16 Mar 1993 00:20:48 GMT From: demaris@austin.ibm.com (Dave Demaris) Organization: IBM Advanced Workstation Division Subject: automata simulators supporting changing rules between generations Message-Id: Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM generations Keywords: I'd like to do some research involving systematic modulation of the lambda parameter (Langton's term); does anyone have a simulator built already that supports this concept? The next best thing would be user rule tables that can be switched between generations. Can any users of cellsim or Autodesk CA-Lab comment on the ease of doing this in either of those environments? One or two dimensional simulators are OK. I'm also interested in any existing research along these lines, particularly regarding adaptation, such as evolving CA's to perform some task. I know the work suggesting the critical or edge of chaos zone is better for adaptation, and saw the recent post by Packard suggesting that some of those results may have been artifacts of the problem structure. From cellular-automata-request@Think.COM Tue Mar 16 02:33:18 1993 Received: by mail.think.com; Tue, 16 Mar 93 02:33:20 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 16 Mar 93 02:33:18 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 16 Mar 93 02:33:15 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA00950; Tue, 16 Mar 93 02:18:41 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Tue, 16 Mar 1993 06:02:34 GMT From: pjordan@rp.CSIRO.AU (Patrick Jordan) Organization: CSIRO Division of Radiophysics, NSW, Australia Subject: Theory question Message-Id: <1993Mar16.060234.17037@rp.CSIRO.AU> Newsgroups: comp.theory.cell-automata Sender: ca-request@Think.COM To: ca@Think.COM On page 1 of "Theory and Applications of Cellular Automata", Wolfram says that Cellular Automata have the following defining charactersistics or rules: Discreteness in space: They consist of a discrete grid of spatial cells or sites. Discreteness in time: The value of each cell is updated in a sequence of discrete time steps. Discrete states: Each cell has a finite number of possible values. Homogeneous: All cells are identical, and are arranged in a regular array. Synchronous updating: All cell values are updated in synchrony, each depending on the previous values of neighbouring cells. Deterministic rule: Each cell value is updated according to a fixed, deterministic, rule. Spatially local rule: The rule at each site depends only on values of a local neighbourhood of sites around it. Temporally local rule: The rule for the new value of a site depends only on values for a fixed number of preceding steps (usually just one). -------------- He states that these simplifying assumptions make analysis easier, yet yield few if any restrictions on overall behaviour. Can anyone point me to references where this assumption is established, particularly with respect to the Synchronous Updating rule. Thankyou. Patrick. ------------------------------------------------------------------------------ Patrick Jordan | _ | 1973 Guzzi 850GT CSIRO Divn of Radiophysics | // \ I am not a number, | 1987 Honda GB400TT NSW, Australia | /( 6 ) I am a free man. | pjordan@rp.csiro.au | () \_/ | DoD #0765 ------------------------------------------------------------------------------ From cellular-automata-request@Think.COM Tue Mar 16 03:33:04 1993 Received: by mail.think.com; Tue, 16 Mar 93 03:33:08 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 16 Mar 93 03:33:04 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 16 Mar 93 03:32:59 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA02581; Tue, 16 Mar 93 03:31:52 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Tue, 16 Mar 1993 06:16:39 GMT From: dbell@pdact.pd.necisa.oz.au (David I. Bell) Organization: NEC Information Systems Australia, Canberra Subject: Life program (part 0/18) Message-Id: <1993Mar16.061639.9638@pdact.pd.necisa.oz.au> Newsgroups: comp.theory.cell-automata,alt.sources Sender: ca-request@Think.COM To: ca@Think.COM This is my own version of a Life program, along with a library of some interesting Life objects. It was written in C over a period of many years. It runs using either curses or X11. Other output devices should be easy to add. This program is not meant to be incredibly fast (use xlife for that:-). But it IS meant to allow the easy editing and viewing of Life objects. It can handle very large Life objects, and handles multiple objects at the same time. The commands are documented in life.doc. The documentation is terse and jumps around a bit, but it does cover all the essential ideas. The Makefile will probably need changing to load the X11 libraries correctly for your machine. Also, you can define one of the values TERMIOS or SGTTY to match your machine (or neither if you just want a standard set of default line editing characters). These are only used in scan.c. I hope you enjoy playing with this program. Suggestions for improvements are welcome, as are new interesting Life objects. David I. Bell dbell@pdact.pd.necisa.oz.au From cellular-automata-request@Think.COM Tue Mar 16 03:33:56 1993 Received: by mail.think.com; Tue, 16 Mar 93 03:34:04 -0500 Return-Path: <@bloom-beacon.MIT.EDU:ca-request@think.com> Received: from Think.COM by mail.think.com; Tue, 16 Mar 93 03:33:56 -0500 Received: from bloom-beacon.MIT.EDU by Early-Bird.Think.COM; Tue, 16 Mar 93 03:33:09 EST Received: by bloom-beacon.MIT.EDU (5.61/25-eef) id AA02588; Tue, 16 Mar 93 03:32:32 EST Received: from USENET by bloom-beacon.mit.edu with netnews for ca@think.com (ca@think.com) (contact usenet@bloom-beacon.mit.edu if you have questions about the mail<->USENET gateway, but not about mailing list subscriptions) Date: Tue, 16 Mar 1993 06:17:50 GMT From: dbell@pdact.pd.necisa.oz.au (David I. Bell) Organization: NEC Information Systems Australia, Canberra Subject: Life program (part 1/18) Message-Id: <1993Mar16.061750.9701@pdact.pd.necisa.oz.au> Newsgroups: comp.theory.cell-automata,alt.sources Sender: ca-request@Think.COM To: ca@Think.COM #!/bin/sh # This is a shell archive (shar 3.32) # made 03/16/1993 05:49 UTC by dbell@elm # Source directory /usr/users/dbell/src # # existing files WILL be overwritten # # This is part 1 of a multipart archive # do not concatenate these parts, unpack them in order with /bin/sh # # This shar contains: # length mode name # ------ ---------- ------------------------------------------ # 2068 -rw-r--r-- life/alloc.c # 3649 -rw-r--r-- life/cell.c # 15720 -rw-r--r-- life/cmd.c # 14656 -rw-r--r-- life/cmdl.c # 4578 -rw-r--r-- life/gen.c # 20146 -rw-r--r-- life/io.c # 1308 -rw-r--r-- life/lib/README # 2986 -rw-r--r-- life/lib/puff/shiprake.l # 584 -rw------- life/lib/puff/switch.l # 2141 -rw-r--r-- life/lib/puff/c3puff.l # 398 -rw-r--r-- life/lib/puff/p32rake.l # 672 -rw-r--r-- life/lib/puff/p292.l # 1464 -rw-r--r-- life/lib/puff/p24.l # 1922 -rw-r--r-- life/lib/puff/p12.l # 1255 -rw-r--r-- life/lib/puff/p1340.l # 2772 -rw-r--r-- life/lib/puff/c3rake.l # 994 -rw-r--r-- life/lib/puff/p20.l # 434 -rw-r--r-- life/lib/puff/p8-2.l # 590 -rw-r--r-- life/lib/puff/p8-3.l # 1968 -rw-r--r-- life/lib/puff/engines.l # 1451 -rw-r--r-- life/lib/puff/p1136.l # 893 -rw-r--r-- life/lib/puff/p60rake.l # 577 -rw-r--r-- life/lib/puff/p8-1.l # 1091 -rw-r--r-- life/lib/gun/p30ship.l # 873 -rw------- life/lib/gun/p46-1.l # 526 -rw-r--r-- life/lib/gun/p46-2.l # 61324 -rw-r--r-- life/lib/gun/p1100.l # 726 -rw-r--r-- life/lib/gun/p120.l # 1807 -rw-r--r-- life/lib/gun/p120ship.l # 5288 -rw-r--r-- life/lib/gun/p144.l # 1212 -rw-r--r-- life/lib/gun/p150.l # 3188 -rw-r--r-- life/lib/gun/p150ship.l # 13111 -rw-r--r-- life/lib/gun/p15.l # 4341 -rw-r--r-- life/lib/gun/p168.l # 676 -rw-r--r-- life/lib/gun/p210.l # 2616 -rw-r--r-- life/lib/gun/p23.l # 1059 -rw-r--r-- life/lib/gun/p240.l # 1174 -rw-r--r-- life/lib/gun/p276.l # 1500 -rw-r--r-- life/lib/gun/p360.l # 3311 -rw-r--r-- life/lib/gun/p44.l # 4227 -rw-r--r-- life/lib/gun/p500.l # 934 -rw-r--r-- life/lib/gun/p90.l # 929 -rw-r--r-- life/lib/gun/p46guns.l # 6947 -rw-r--r-- life/lib/gun/p94.l # 1263 -rw-r--r-- life/lib/gun/p960.l # 2130 -rw-r--r-- life/lib/gun/rand-1.l # 3047 -rw-r--r-- life/lib/gun/rand-2.l # 2811 -rw-r--r-- life/lib/gun/rand-3.l # 1795 -rw-r--r-- life/lib/gun/p60-2.l # 2428 -rw------- life/lib/gun/p46ship-2.l # 1172 -rw-r--r-- life/lib/gun/p46ship-1.l # 2041 -rw-r--r-- life/lib/gun/p60-1.l # 636 -rw-r--r-- life/lib/gun/p60-3.l # 411 -rw-r--r-- life/lib/gun/p30.l # 9753 -rw-r--r-- life/lib/gun/primer.l # 1207 -rw-r--r-- life/lib/ship/hp/p1136.l # 1792 -rw-r--r-- life/lib/ship/hp/bhep.l # 1580 -rw------- life/lib/ship/hp/p1044.l # 419 -rw-r--r-- life/lib/ship/c2.5/s1-1.l # 338 -rw-r--r-- life/lib/ship/c2.5/s2.l # 231 -rw-r--r-- life/lib/ship/c2.5/s1.l # 544 -rw-r--r-- life/lib/ship/p4/s2.l # 348 -rw------- life/lib/ship/p4/escorts.l # 216 -rw-r--r-- life/lib/ship/p4/s1.l # 2825 -rw-r--r-- life/lib/ship/p4/ships.l # 5391 -rw-r--r-- life/lib/ship/p4/huge.l # 436 -rw-r--r-- life/lib/ship/p4/s3.l # 196 -rw-r--r-- life/lib/ship/p4/push.l # 3993 -rw-r--r-- life/lib/ship/c12.l # 1333 -rw-r--r-- life/lib/ship/c2/p6ship.l # 2718 -rw-r--r-- life/lib/ship/c2/tree.l # 911 -rw-r--r-- life/lib/ship/c2/loop.l # 4909 -rw-r--r-- life/lib/ship/c2/branch.l # 1564 -rw-r--r-- life/lib/ship/c2/pole.l # 849 -rw-r--r-- life/lib/ship/c2/s5.l # 775 -rw-r--r-- life/lib/ship/c2/s3.l # 416 -rw-r--r-- life/lib/ship/c2/s2.l # 770 -rw-r--r-- life/lib/ship/c2/s1.l # 2337 -rw-r--r-- life/lib/ship/c2/block.l # 565 -rw-r--r-- life/lib/ship/c3/p9.l # 297 -rw-r--r-- life/lib/ship/c3/s11.l # 809 -rw-r--r-- life/lib/ship/c3/s6.l # 307 -rw-r--r-- life/lib/ship/c3/s3.l # 280 -rw-r--r-- life/lib/ship/c3/s2.l # 395 -rw-r--r-- life/lib/ship/c3/s4.l # 757 -rw-r--r-- life/lib/ship/c3/s2-2.l # 748 -rw-r--r-- life/lib/ship/c3/s2-3.l # 455 -rw-r--r-- life/lib/ship/c3/s5-arm.l # 246 -rw-r--r-- life/lib/ship/c3/s5.l # 1079 -rw-r--r-- life/lib/ship/c3/multp9.l # 392 -rw-r--r-- life/lib/ship/c3/s5-1.l # 3957 -rw-r--r-- life/lib/ship/c3/dense.l # 2521 -rw-r--r-- life/lib/ship/c3/branch.l # 582 -rw-r--r-- life/lib/ship/c3/s9.l # 265 -rw-r--r-- life/lib/ship/c3/s10.l # 980 -rw-r--r-- life/lib/ship/c3/s9-1.l # 900 -rw-r--r-- life/lib/ship/c3/s2-1.l # 2602 -rw-r--r-- life/lib/ship/c3/ships.l # 840 -rw-r--r-- life/lib/ship/c3/weave.l # 194 -rw-r--r-- life/lib/ship/c3/s1.l # 814 -rw-r--r-- life/lib/ship/c4/bigglider-1.l # 655 -rw------- life/lib/ship/c4/s1.l # 697 -rw-r--r-- life/lib/ship/c4/s2.l # 392 -rw-r--r-- life/lib/ship/c4/s3.l # 492 -rw-r--r-- life/lib/ship/c4/s5.l # 405 -rw-r--r-- life/lib/ship/c4/bigglider.l # 333 -rw-r--r-- life/lib/ship/c4/s4.l # 2807 -rw-r--r-- life/lib/ship/c4/huge.l # 644 -rw-r--r-- life/lib/ship/c4/s8.l # 736 -rw-r--r-- life/lib/ship/c4/s1-1.l # 486 -rw-r--r-- life/lib/ship/c4/s9.l # 546 -rw-r--r-- life/lib/ship/c4/s6.l # 454 -rw-r--r-- life/lib/ship/c4/s4-1.l # 504 -rw-r--r-- life/lib/ship/c4/s10.l # 455 -rw-r--r-- life/lib/ship/c4/s11.l # 552 -rw-r--r-- life/lib/ship/c4/s12.l # 385 -rw-r--r-- life/lib/ship/c4/s7.l # 4287 -rw-r--r-- life/lib/ship/c4/tags.l # 26150 -rw-r--r-- life/lib/osc/stamp.l # 968 -rw-r--r-- life/lib/osc/p100.l # 758 -rw-r--r-- life/lib/osc/p12-2.l # 561 -rw-r--r-- life/lib/osc/p12.l # 1764 -rw-r--r-- life/lib/osc/eatguns.l # 1018 -rw-r--r-- life/lib/osc/relay/p184.l # 718 -rw-r--r-- life/lib/osc/relay/p276.l # 2805 -rw------- life/lib/osc/relay/p46.l # 1184 -rw-r--r-- life/lib/osc/relay/p30.l # 2511 -rw-r--r-- life/lib/osc/relay/p874.l # 1069 -rw-r--r-- life/lib/osc/relay/p135.l # 3839 -rw-r--r-- life/lib/osc/relay/p230.l # 1633 -rw-r--r-- life/lib/osc/relay/p50.l # 903 -rw-r--r-- life/lib/osc/relay/p66.l # 774 -rw-r--r-- life/lib/osc/relay/p75.l # 2871 -rw-r--r-- life/lib/osc/relay/p270.l # 359 -rw------- life/lib/osc/relay/p60.l # 621 -rw-r--r-- life/lib/osc/p16.l # 444 -rw-r--r-- life/lib/osc/p72.l # 2382 -rw-r--r-- life/lib/osc/p256.l # 1198 -rw-r--r-- life/lib/osc/p26.l # 373 -rw-r--r-- life/lib/osc/p28.l # 531 -rw-r--r-- life/lib/osc/p29-1.l # 621 -rw-r--r-- life/lib/osc/p29-2.l # 2235 -rw-r--r-- life/lib/osc/p3.l # 219 -rw-r--r-- life/lib/osc/p30.l # 3313 -rw-r--r-- life/lib/osc/p32.l # 509 -rw-r--r-- life/lib/osc/p40.l # 982 -rw-r--r-- life/lib/osc/p44.l # 339 -rw-rw-rw- life/lib/osc/p46.l # 669 -rw-r--r-- life/lib/osc/p47.l # 5671 -rw-r--r-- life/lib/osc/p4o2.l # 271 -rw-r--r-- life/lib/osc/p52.l # 446 -rw-r--r-- life/lib/osc/p54.l # 639 -rw-r--r-- life/lib/osc/p56.l # 2712 -rw-r--r-- life/lib/osc/p6o2.l # 2055 -rw-r--r-- life/lib/osc/p7.l # 2738 -rw-r--r-- life/lib/osc/p9.l # 816 -rw------- life/lib/osc/shuttles.l # 10826 -rw-r--r-- life/lib/osc/beetrack.l # 2026 -rw-r--r-- life/lib/osc/queenbees.l # 1309 -rw-r--r-- life/lib/osc/fence.l # 1685 -rw-r--r-- life/lib/osc/spinner.l # 1015 -rw-r--r-- life/lib/osc/p55.l # 4254 -rw-r--r-- life/lib/grow/caber.l # 2820 -rw-r--r-- life/lib/grow/irrat.l # 28522 -rw-r--r-- life/lib/grow/logpuff.l # 5101 -rw-r--r-- life/lib/grow/hotel.l # 6940 -rw-r--r-- life/lib/grow/growloop.l # 916 -rw-r--r-- life/lib/grow/aperiodic.l # 2307 -rw-r--r-- life/lib/grow/spiral.l # 1731 -rw-r--r-- life/lib/grow/thue.l # 8971 -rw-r--r-- life/lib/grow/logsq.l # 5940 -rw-r--r-- life/lib/grow/breed/b2.l # 11348 -rw-r--r-- life/lib/grow/breed/b3.l # 13666 -rw-r--r-- life/lib/grow/breed/b1.l # 5136 -rw-r--r-- life/lib/grow/sawtooth/s2.l # 6104 -rw-r--r-- life/lib/grow/sawtooth/s3.l # 4304 -rw-r--r-- life/lib/grow/sawtooth/s4.l # 5022 -rw-r--r-- life/lib/grow/sawtooth/s5.l # 9491 -rw-r--r-- life/lib/grow/sawtooth/s6.l # 11052 -rw-r--r-- life/lib/grow/sawtooth/s7.l # 6618 -rw-r--r-- life/lib/grow/sawtooth/s8.l # 5250 -rw-r--r-- life/lib/grow/sawtooth/s1.l # 979 -rw-r--r-- life/lib/grow/stretch/ws2.l # 1155 -rw------- life/lib/grow/stretch/blinkership.l # 788 -rw-r--r-- life/lib/grow/stretch/ws1.l # 4201 -rw-r--r-- life/lib/grow/stretch/piship.l # 636 -rw-r--r-- life/lib/grow/stretch/blglship.l # 7024 -rw-r--r-- life/lib/grow/sbm.l # 7898 -rw------- life/lib/obj/acorn.l # 431 -rw-r--r-- life/lib/obj/ak47.l # 2092 -rw------- life/lib/obj/rpent.l # 706 -rw-r--r-- life/lib/obj/injectors.l # 2570 -rw-r--r-- life/lib/obj/togglegun.l # 1528 -rw-r--r-- life/lib/obj/gliderturns.l # 2015 -rw-r--r-- life/lib/obj/fanout.l # 5965 -rw-r--r-- life/lib/obj/heisenburp.l # 714 -rw------- life/lib/obj/life34.l # 5055 -rw-r--r-- life/lib/obj/counter.l # 5457 -rw-r--r-- life/lib/obj/blockpusher.l # 4619 -rw-r--r-- life/lib/obj/p210fanout.l # 165 -rw-r--r-- life/lib/obj/bounce.l # 2014 -rw-r--r-- life/lib/obj/shiptoggle.l # 764 -rw-r--r-- life/lib/obj/detector.l # 31040 -rw------- life/life.doc # 15837 -rw------- life/life.h # 4926 -rw-r--r-- life/main.c # 9232 -rw-r--r-- life/mark.c # 8587 -rw-r--r-- life/object.c # 3924 -rw-r--r-- life/scan.c # 360 -rw------- life/Makefile # 9210 -rw-r--r-- life/vars.c # 6178 -rw-r--r-- life/view.c # 7567 -rw-r--r-- life/ttydev.c # 12560 -rw-r--r-- life/file.c # 1051 -rw-r--r-- life/README # 19386 -rw-r--r-- life/x11dev.c # if touch 2>&1 | fgrep 'amc' > /dev/null then TOUCH=touch else TOUCH=true fi if test -r shar3_seq_.tmp; then echo "Must unpack archives in sequence!" next=`cat shar3_seq_.tmp`; echo "Please unpack part $next next" exit 1 fi # ============= life/alloc.c ============== if test ! -d 'life'; then echo "x - creating directory life" mkdir 'life' fi echo "x - extracting life/alloc.c (Text)" sed 's/^X//' << 'SHAR_EOF' > life/alloc.c && X/* X * Copyright (c) 1993 David I. Bell X * Permission is granted to use, distribute, or modify this source, X * provided that this copyright notice remains intact. X */ X X#include "life.h" X X X/* X * Allocate a new object structure. It contains one row element, the termrow. X */ XOBJECT * Xallocobject() X{ X register OBJECT *obj; X X obj = freeobjects; X if (obj) X freeobjects = obj->o_next; X else { X obj = newobjects; X if (obj >= endobjects) { /* allocate new storage */ X obj = (OBJECT *) malloc(sizeof(OBJECT) * ALLOCOBJ); X if (obj == NULL) { X perror("malloc"); X exit(1); X } X newobjects = obj; X endobjects = obj + ALLOCOBJ; X } X newobjects++; X } X X obj->o_next = NULL; X obj->o_firstrow = termrow; X obj->o_lastrow = NULL; X obj->o_reserved = reserve; X obj->o_name[0] = '\0'; X obj->o_count = 0; X obj->o_gen = 0; X obj->o_currow = 0; X obj->o_curcol = 0; X obj->o_prow = 0; X obj->o_pcol = 0; X obj->o_mark = 0; X obj->o_autoscale = FALSE; X obj->o_frequency = defaultfrequency; X setscale(obj, defaultscale); X X return obj; X} X X X/* X * Allocate a new row structure. It contains one row element, the termcell. X */ XROW * Xallocrow() X{ X register ROW *rp; X X rp = freerows; X if (rp) X freerows = rp->r_next; X else { X rp = newrows; X if (rp >= endrows) { /* allocate new storage */ X rp = (ROW *) malloc(sizeof(ROW) * ALLOCROW); X if (rp == NULL) { X perror("malloc"); X exit(1); X } X newrows = rp; X endrows = rp + ALLOCROW; X } X newrows++; X } X X rp->r_next = NULL; X rp->r_firstcell = termcell; X rp->r_lastcell = NULL; X rp->r_count = 0; X X return rp; X} X X X/* X * Allocate a new cell structure. X */ XCELL * Xalloccell() X{ X register CELL *cp; X X cp = freecells; X if (cp) { X freecells = cp->c_next; X cp->c_next = NULL; X cp->c_marks = MARK_ANY; X return cp; X } X X cp = newcells; X if (cp >= endcells) { /* allocate new storage */ X cp = (CELL *) malloc(sizeof(CELL) * ALLOCCELL); X if (cp == NULL) { X perror("malloc"); X exit(1); X } X newcells = cp; X endcells = cp + ALLOCCELL; X } X X newcells++; X cp->c_next = NULL; X cp->c_marks = MARK_ANY; X X return cp; X} X X/* END CODE */ SHAR_EOF $TOUCH -am 0316122993 life/alloc.c && chmod 0644 life/alloc.c || echo "restore of life/alloc.c failed" set `wc -c life/alloc.c`;Wc_c=$1 if test "$Wc_c" != "2068"; then echo original size 2068, current size $Wc_c fi # ============= life/cell.c ============== echo "x - extracting life/cell.c (Text)" sed 's/^X//' << 'SHAR_EOF' > life/cell.c && X/* X * Copyright (c) 1993 David I. Bell X * Permission is granted to use, distribute, or modify this source, X * provided that this copyright notice remains intact. X */ X X#include "life.h" X X X/* X * Return a row structure for a given row number, returning NULL if not there. X */ XROW * Xfindrow(obj, row) X OBJECT *obj; X COORD row; X{ X register ROW *rp; X X for (rp = obj->o_firstrow; (row > rp->r_row); rp = rp->r_next) X ; X X if (rp->r_row != row) X return NULL; X X return rp; X} X X X/* X * Return a row structure for a given row number, creating it if needed. X */ XROW * Xgetrow(obj, row) X OBJECT *obj; X COORD row; X{ X register ROW *rp; /* current row */ X register ROW *nrp; /* next row */ X register ROW *prp; /* previous row */ X X rp = obj->o_firstrow; X if (row < rp->r_row) { /* at front */ X nrp = allocrow(); X nrp->r_row = row; X nrp->r_next = obj->o_firstrow; X obj->o_firstrow = nrp; X if (nrp->r_next == termrow) X obj->o_lastrow = nrp; X return nrp; X } X X if (row >= obj->o_lastrow->r_row) X rp = obj->o_lastrow; X X while (row > rp->r_row) { X prp = rp; X rp = rp->r_next; X } X X if (row == rp->r_row) { X return rp; X } X X nrp = allocrow(); X nrp->r_row = row; X nrp->r_next = rp; X prp->r_next = nrp; X X if (nrp->r_next == termrow) X obj->o_lastrow = nrp; X X return nrp; X} X X X/* X * Find a cell given its coordinates, returning NULL if not found. X */ XCELL * Xfindcell(obj, row, col) X OBJECT *obj; X COORD row; X COORD col; X{ X register CELL *cp; X ROW *rp; X X rp = findrow(obj, row); X if (rp == NULL) X return NULL; X X for (cp = rp->r_firstcell; col > cp->c_col; cp = cp->c_next) X ; X X if (col != cp->c_col) X return NULL; X X return cp; X} X X X/* X * Create a cell at a given row and column. Returns nonzero if the cell X * already existed. If the cell is new, it is marked with the current X * mark value of the object. X */ XBOOL Xaddcell(obj, row, col) X OBJECT *obj; X COORD row; X COORD col; X{ X register CELL *cp; /* current cell */ X register CELL *ncp; /* next cell */ X register CELL *pcp; /* previous cell */ X ROW *rp; X X rp = getrow(obj, row); X cp = rp->r_firstcell; X X if ((cp != termcell) && (col >= rp->r_lastcell->c_col)) { X pcp = rp->r_lastcell; /* at end */ X if (col == pcp->c_col) X return TRUE; X X ncp = alloccell(); X ncp->c_col = col; X ncp->c_marks |= obj->o_mark; X ncp->c_next = termcell; X pcp->c_next = ncp; X rp->r_lastcell = ncp; X rp->r_count++; X obj->o_count++; X return FALSE; X } X X if (col < cp->c_col) { X ncp = alloccell(); /* at front */ X ncp->c_col = col; X ncp->c_marks |= obj->o_mark; X ncp->c_next = cp; X rp->r_firstcell = ncp; X if (cp == termcell) X rp->r_lastcell = ncp; X rp->r_count++; X obj->o_count++; X return FALSE; X } X X while (col > cp->c_col) { /* in middle */ X pcp = cp; X cp = pcp->c_next; X } X X if (col == cp->c_col) X return TRUE; X X ncp = alloccell(); X ncp->c_col = col; X ncp->c_marks |= obj->o_mark; X ncp->c_next = cp; X pcp->c_next = ncp; X if (cp == termcell) X rp->r_lastcell = ncp; X rp->r_count++; X obj->o_count++; X X return FALSE; X} X X X/* X * Delete a cell at a given coordinate. Returns nonzero if it did not exist. X */ XBOOL Xdelcell(obj, row, col) X OBJECT *obj; X COORD row; X COORD col; X{ X register ROW *rp; X register CELL *pcp; /* previous cell */ X register CELL *cp; /* current cell */ X X rp = findrow(obj, row); X if (rp == NULL) X return TRUE; X X pcp = NULL; X cp = rp->r_firstcell; X X while (col > cp->c_col) { X pcp = cp; X cp = cp->c_next; X } X X if (col != cp->c_col) X return TRUE; X X if (pcp) X pcp->c_next = cp->c_next; X else X rp->r_firstcell = cp->c_next; X X if (cp->c_next == termcell) X rp->r_lastcell = pcp; X X cp->c_next = freecells; X freecells = cp; X rp->r_count--; X obj->o_count--; X X return FALSE; X} X X/* END CODE */ SHAR_EOF $TOUCH -am 0316122993 life/cell.c && chmod 0644 life/cell.c || echo "restore of life/cell.c failed" set `wc -c life/cell.c`;Wc_c=$1 if test "$Wc_c" != "3649"; then echo original size 3649, current size $Wc_c fi # ============= life/cmd.c ============== echo "x - extracting life/cmd.c (Text)" sed 's/^X//' << 'SHAR_EOF' > life/cmd.c && X/* X * Copyright (c) 1993 David I. Bell X * Permission is granted to use, distribute, or modify this source, X * provided that this copyright notice remains intact. X */ X X#include "life.h" X X X#define ZERO ((VALUE) 0) X Xstatic int readvalue(); Xstatic VALUE scanexpr(); Xstatic void doselect(); Xstatic void domove(); Xstatic void doshift(); Xstatic void dosearch(); X X X/* X * Read commands if available, and execute them. Since we call scanchar for X * our characters, the code after the setjmp can be reentered many times in X * order to finish any command. This allows commands to be typed without X * stopping the computation of generations of an object, and allows editing X * of partially completed commands. X */ Xvoid Xdocommand() X{ X register int ch; /* character read */ X register OBJECT *obj; /* object being manipulated */ X VALUE defarg; /* first argument defaulted to one */ X VALUE arg1; /* first command argument */ X VALUE arg2; /* second command argument */ X BOOL got1; /* got first argument flag */ X BOOL got2; /* got second argument flag */ X char *saveloopptr; /* crock for loop definitions */ X X switch (setjmp(ttyjmp)) { X case SCAN_EDIT: /* command edited before completion */ X curinput->i_endptr = saveloopptr; X break; X X case SCAN_EOF: /* not yet enough chars for a command */ X curinput->i_endptr = saveloopptr; X return; X X case SCAN_ABORT: /* normal command completion */ X X default: /* normal entry point */ X saveloopptr = curinput->i_endptr; X break; X } X X if (stop) X error("Command aborted"); X X obj = curobj; X cmark = 0; X arg2 = 0; X got2 = FALSE; X X ch = readvalue(&arg1, &got1); X if (ch == ',') X ch = readvalue(&arg2, &got2); X X defarg = 1; X if (got1) X defarg = arg1; X X switch (ch) { X case FF: /* refresh screen */ X (*dev->refresh)(dev); X update |= U_ALL; X break; X X case '\n': /* move to next row */ X crow += defarg; X ccol = pcol; X update |= U_POS; X break; X X case '\t': /* move to next tab stop */ X while ((++ccol - pcol) % 8) X ; X update |= U_POS; X break; X X case ESC: /* execute a macro command */ X ch = scanchar(); X if (ch == ESC) X break; /* ignore double escape */ X backup(); X if (setmacro(arg1, arg2, ch)) X error("Undefined macro"); X update |= U_STAT; X break; X X case ' ': /* move to right */ X case '.': X ccol += defarg; X update |= U_POS; X break; X X case ':': /* execute line style command */ X case ';': X dolinecommand(arg1, arg2, got1, got2); X break; X X case '<': /* begin loop or macro definition */ X if (got1 || got2) { X if (got2) X setloop(defarg, arg2, 0); X else X setloop(1, defarg, 0); X update |= U_STAT; X break; X } X ch = scanchar(); /* defining macro */ X if ((ch < 'a') || (ch > 'z')) { X error("Bad macro character"); X } X setloop(1, 1, ch); X update |= U_STAT; X break; X X case '>': /* end loop */ X endloop(); X break; X X case '+': /* increment single char variable */ X ch = scanchar(); X if (ch == '$') X ch = scanchar(); X setvariable1(ch, getvariable1(ch) + defarg); X break; X X case 'b': /* move lower left with action */ X domove(defarg, -defarg); X break; X X case 'B': /* shift to lower left */ X doshift(defarg, -defarg); X break; X X case 'c': /* pick cell as current location */ X crow = prow + arg1; X ccol = pcol + arg2; X update |= U_POS; X break; X X case 'd': /* delete selection */ X doselect(ch); X backup(); X movemarkedobject(obj, deleteobject, MARK_CMD); X update |= U_ALL; X break; X X case 'f': /* flip selection */ X ch = scanchar(); X if ((ch != 'r') && (ch != 'c')) X error("Bad flip axis"); X doselect('f'); X backup(); X cmark = MARK_USR; X if (ch == 'r') X fliprowmarkedobject(obj, MARK_CMD); X else X flipcolmarkedobject(obj, MARK_CMD); X update |= U_ALL; X break; X X case 'g': /* compute generations */ X if (genleft <= 0) X backup(); X if (got1) X genleft += arg1; X else if (genleft) { X genleft = 0; X update |= U_ALL; X } else X genleft = 1; X freqcount = curobj->o_frequency; X update |= U_POS; X break; X X case 'G': /* compute infinite generations */ X if (genleft <= 0) X backup(); X genleft = INFINITY; X freqcount = curobj->o_frequency; X update |= U_POS; X break; X X case 'h': /* move left with action */ X domove(ZERO, -defarg); X break; X X case 'H': /* shift left lots */ X doshift(ZERO, -defarg); X break; X X case 'j': /* move down with action */ X domove(defarg, ZERO); X break; X X case 'J': /* shift down lots */ X doshift(defarg, ZERO); X break; X X case 'k': /* move up with action */ X domove(-defarg, ZERO); X break; X X case 'K': /* shift up lots */ X doshift(-defarg, ZERO); X break; X X case 'l': /* move right with action */ X domove(ZERO, defarg); X break; X X case 'L': /* shift right lots */ X doshift(ZERO, defarg); X break; X X case 'm': /* mark current object */ X doselect(ch); X copymarks(obj, MARK_CMD, MARK_USR); X update |= U_ALL; X break; X X case 'n': /* move lower right with action */ X domove(defarg, defarg); X break; X X case 'N': /* shift down and right */ X doshift(defarg, defarg); X break; X X case 'o': /* insert new cells */ X case 'O': X case '*': X checkrun(); X backup(); X while (!stop && (defarg-- > 0)) X addcell(obj, crow, ccol++); X update |= U_ALL; X break; X X case 'p': /* place deleted object */ X checkrun(); X backup(); X cmark = MARK_USR; X addobject(deleteobject, obj, RELATIVE); X update |= U_ALL; X break; X X case 'r': /* rotate selection */ X doselect(ch); X backup(); X cmark = MARK_USR; X rotatemarkedobject(obj, MARK_CMD); X update |= U_ALL; X break; X X case 's': /* set scale factor and center object */ X obj->o_autoscale = FALSE; X if (!got1) X arg1 = obj->o_scale; X setscale(obj, arg1); X break; X X case 'S': /* perform auto-scaling */ X if (!got1) X arg1 = obj->o_scale; X setscale(obj, arg1); X obj->o_autoscale = TRUE; X update |= U_ALL; X break; X X case 't': /* toggle current cell */ X checkrun(); X backup(); X if (delcell(obj, crow, ccol)) X addcell(obj, crow, ccol); X update |= U_ALL; X break; X X case 'u': /* move upper right with action */ X domove(-defarg, defarg); X break; X X case 'U': /* shift to upper right */ X doshift(-defarg, defarg); X break; X X case 'x': /* kill current cells */ X checkrun(); X backup(); X while (!stop && (defarg-- > 0)) X delcell(obj, crow, ccol++); X update |= U_ALL; X break; X X case 'y': /* move upper left with action */ X domove(-defarg, -defarg); X break; X X case 'Y': /* shift to upper left */ X doshift(-defarg, -defarg); X break; X X case 'z': /* clear or set generation number */ X checkrun(); X obj->o_gen = arg1; X obj->o_born = 0; X obj->o_died = 0; X update |= U_STAT; X break; X X case '/': /* search for next object */ X dosearch(defarg); X break; X X case '@': /* point at current location */ X prow = crow; X pcol = ccol; X break; X X case '!': /* comment characters */ X case '#': X while (scanchar() != '\n') X ; X break; X X case NULL_CMD: /* null command */ X break; X X default: /* unknown commands */ X if (ch == veof) { X (*curinput->i_term)(curinput); X break; X } X X error("Unknown command"); X } X X scanabort(); /* completed command */ X} X X X/* X * Read a numeric value (if any) to be used as an argument for a command. X * Pointers to the returned value and returned flag are given. X * Return value is the first non-argument character read. X */ Xstatic int Xreadvalue(valueptr, flagptr) X VALUE *valueptr; /* pointer to returned value */ X BOOL *flagptr; /* pointer to got value flag */ X{ X register int ch; /* character being read */ X register INPUT *ip; /* input structure */ X int sign; /* sign of result */ X X *valueptr = 0; X *flagptr = FALSE; X sign = 1; X X ch = scanchar(); X X if (ch == '-') { /* negative value */ X sign = -1; X ch = scanchar(); X } X X if (ch == '$') { /* get variable value */ X *valueptr = sign * getvariable1(scanchar()); X *flagptr = TRUE; X return scanchar(); X } X X if (ch == '(') { /* get expression */ X *valueptr = sign * scanexpr(); X *flagptr = TRUE; X return scanchar(); X } X X while (isdigit(ch)) { /* get numeric value */ X *valueptr = (*valueptr * 10) + ch - '0'; X *flagptr = TRUE; X ch = scanchar(); X } X X if (ch == '%') { /* get loop value */ X ch = 1; X if (*flagptr) X ch = *valueptr; X if (ch <= 0) X error("Bad nest value"); X ip = curinput + 1; X X while (ch > 0) { X if (--ip < inputs) X error("Bad nest value"); X if (ip->i_type == INP_LOOP) X ch--; X } X X *valueptr = ip->i_curval; X *flagptr = TRUE; X ch = scanchar(); X } X X *valueptr *= sign; X return ch; X} X X X/* X * Routine called from above to scan and evaluate a parenthesized expression. X * This routines knows that one parenthesis has already been read. Stops X * reading on the matching parenthesis. X */ Xstatic VALUE Xscanexpr() X{ X register char *cp; /* current character */ X int nest; /* nesting depth */ X char buf[100]; /* expression buffer */ X X cp = buf; X *cp++ = '('; /* start with parenthesis */ X nest = 1; X X while (nest > 0) { X if (cp >= &buf[sizeof(buf)-2]) X error("exp