| Alife Database By Html (Main Menu) |
| Not Found | Not Found The requested URL was not found on this server. | |
| Artificial Life | A Message from the Editors If you haven't done so already, please take a few seconds to go to the Splash Page and read about the renovations going on here at Alife Online. We realize that many users have this page bookmarked, not that one, but because of the construction currently underway, we strongly advise changing your bookmarks to point at http://alife.santafe.edu/index.html, and not this pa | |
| Artificial Life Software | Artificial Life software Much of the software listed here is also available via anonymous ftp at alife.santafe.edu. Unix JVN: An implementation of the John von Neumann Universal Constructor (R. Nobili and U. Pesavento) Netlife: evolving neural nets in an environment (Christopher Busch) Primoridal Soup: an artificial life system that spontaneously generates self-reproducing organisms from a steril | |
| Artificial life links | Artificial life links Here is my collection of artificial life links. Those that are a must-see are marked with an asterisk (*). If you see any links that are outdated or have changed (particularly if you're the owner of them), contact me and I'll update them. Contents Resources Nonlinear dynamics Cellular automata Lindenmeyer systems (L-systems) Finite state machines & von Neumann machines Adapt | |
| Artificial life links | Artificial life links Here is my collection of artificial life links. Those that are a must-see are marked with an asterisk (*). If you see any links that are outdated or have changed (particularly if you're the owner of them), contact me and I'll update them. Contents Resources Nonlinear dynamics Cellular automata Lindenmeyer systems (L-systems) Finite state machines & von Neumann machines Adapt | |
| File Not found | File Not found The requested URL /~faisal/man/bookmarks.html was not found on this server. | |
| Java Applets for Neural Network and Artificial Life | Applets for Neural Networks and Artificial Life (To Japanese version) Competitive Learning Vector Quantizer (VQ) Related to hard competitive learning. (in Japanese) Gaussian Mixture Model Related to soft competitive learning. Multinomial Mixture Model Self-Organizing Maps (SOM) 1 Self-Organizing Map (SOM) 2 Interactive SOM 3D SOM Go to `sample applet'. SOM for the Travelling Salesman Problem(TSP) | |
| Links to online papers on Self-Organisation, Complexity and Artificial Life compiled by CALResCo | We provide links to many online HTML papers | Complexity Papers Online Some other papers can be located via the Applications and Themes pages. Collections of Papers AI and the Humanities - ed. Franchi & Güzeldere Chaos, Self-Emergence, Evolution, Alife - links by Umur Ozkul Self-Organising Systems - various, plus some postscript, gopher and links Lee Altenberg - evolution and ecology Brint collection - management & organisation William Calvi |
| Ragman's Robotics Links | LINK MENU ROBOTICS VISITOR NUMBER ROBOTICS @~Artificial Life resources AI~WHEEL: Universal Robotics Brain Cells. The missing cog of machine intelligence. ALife Bibliography Applied ALife Artificial Life Online Artificial Life Software Behavior Biology Boids (Flocks, Herds, and Schools: a Distributed Behavioral Model) Complexity Dave's Artificial Life Pages Development Evolution and Learning Evolu | |
| comp.ai.alife FAQ: Artificial Life Resources | Last updated: Tuesday, December 19th 1995. (recent changes) Read my mission statement - where I hope this Web resource will go in the future... This WWW site provides a supplemental resource for the comp.ai.alife FAQ. Below are some generally useful resources, as well as information on where to find related FAQs, journals, and (in the spirit of the WWW) information on more specialized topics than | |
| Frequently Asked Questions About Cellular Automata | Frequently Asked Questions About Cellular Automata | Frequently Asked Questions About Cellular Automata Contributions from the CA community edited by Howard Gutowitz hag@santafe.edu June 1996 The major sections of this FAQ can be obtained from the FTP server, in ASCII or Postscript. When you find broken links, or have new information to contribute, write to the FAQ editor. Generalities. What are CA? General references on CA? What is the CA list? Go |
| Package: areas/alife/systems/life/hensel/ | CMU Artificial Intelligence Repository PCLIFE: Implementation of Conway's Game of Life for the PC. areas/alife/systems/life/hensel/ This directory contains a fast implementation of Conway's Game of Life for the IBM PC. It allows a huge universe (524288 x 524288) and includes a large collection of patterns. Origin: life.anu.edu.au:/pub/complex_systems/alife/life/life16.zip Version: | |
| Evolutionary and Adaptive Systems at COGS | Evolutionary and Adaptive Systems at COGS Last update: May 1998 The School of Cognitive and Computing Sciences (COGS) in the University of Sussex at Brighton is home to one of the world's largest groups of researchers studying artificial evolutionary and adaptive systems. Such work is often described using names such as Artificial Life, Evolutionary Computation, and Adaptive Behavior research. Th | |
| Howard Gutowitz's Home Page | Howard Gutowitz Visits since Dec 10, 1995: Papers/Preprints/Patents Gutowitz Bibliography Cellular Automata traffic A cellular automaton model of bi-directional traffic, P. Simon and H. Gutowitz, Phys. Rev. E vol 57:2 pg 2441-2444 (1998) traffic.ps.gz Top The Topological Skeleton of Cellular Automaton Dynamics , C. Domain and H. Gutowitz, Physica D, vol. 103 nos 1-4, pg 155-168 (1997) physd.ps.gz | |
| Vivarium Page | Welcome to Vivarium! Vivarium is an interactive simulation of the evolution of behavior. Lifeforms live and adapt on the screen, under your influence. It's an easy introduction to the principles of artificial life. The program runs on Macintosh computers and requires System 7. It is a binhex encoded Stuffit archive. Get Vivarium. (230K) Here is a sample Vivarium world that demonstrates some of the | |
| Metafind: Search Results {"Cellular Automata"} | MetaFind Multi-Engine Search[MetaFind Remote] [Dogpile] Sending off queries..., Collecting results... Sorting... Words: Cellular Automata Others Cellular 1.1 Informal Definition of Cellular Automata http://www.tu-bs.de/institute/WiR/weimar/ZAscript/node2.html - Each cell evolves according to the same rule which depends only on the state of the cell and a finite number of neighbor | |
| 1.1 Informal Definition of Cellular Automata | 1.1 Informal Definition of Cellular Automata | Next: 1.2 Simple Example Up: 1 Introduction Previous: 1 Introduction 1.1 Informal Definition of Cellular Automata Cellular automata provide a framework for a large class of discrete models with homogeneous interactions. They are characterized by the following fundamental properties: They consist of a regular discrete lattice of cells. The evolution takes place in discrete time steps. Each cell |
| 91.html: Cellular Automata List | Cellular Automata List Bruce Walker (bruce@Think.COM) Tue, 18 Dec 90 11:49:44 -0500 Messages sorted by: [ date ][ thread ][ subject ][ author ] Next message: Bruce Walker: "Cellular Automata List" This is an announcement of the resurrection of the Cellular-Automata@Think.COM mailing list. This list is also known as the CA-L@MITVMA list in the BITNET world, and comp.theory.cell-automata in the ine | |
| ACP: Algorithms on cellular automata | ACP: Algorithms on cellular automata Cliquez ici pour avoir une version française. A cellular automaton is given as a uniform graph network, at each vertex of which a finite automaton (cell) is attached. All these cells communicate in a synchroneous way with their neighbours, along the edges of the graph ( the neighbour notion is uniform too). At discrete times each cell enters a new state, funct | |
| Albert: description | description source binary non-totalistic binary totalistic non-binary totalistic "Albert" Linear Cellular Automata Explorer Created by Simon Horman © 1997 Verge Systems International Here lies my linear cellular automata explorer. Originally known as Wolfram in honor of Stephen Wolfram who has done significant research into this field. The name has been changed to Albert partly because there are | |
| Artificial Life Games Homepage | Artificial Life Games Homepage Cellular Automata Sites In this list are included all the URLs where you can find all ALife Cellular Automata Software Sites. The Cellular Automata is one of the most wide spread technics used in ALife Simulations. 1. CA Dimensional Cellular Automata ( Pennsylvania ) 2. Cellsim is a cellular automaton simulator by David Hiebeler and Chris Langton.( New Mexico ) 3. D | |
| Assorted Java Fractal & Cellular Automata Nuts | ORBIT! | REVISED! The Iterated Prisoner's Dilemna | Gratuitous Chat Room! | Exciting Craps Game! | Log applet for this site| Cellular Automata Applet | Mandelbrot Generator | Julia Sets | Non-Java Chat | Rudy Rucker's Cellular World | Voter Model | Please visit my work homepage. It will make my boss happy ;) Thanks, Ken Source Code! | |
| Books on CA | Books on CA Here is a (probably incomplete) list of some books (excluding proceedings) on cellular automata. They are published in English unless otherwise noticed. If you know additional books, please let me know. 1. S. Achasova and O. Bandman and V. Markova and S. Piskunov: Parallel substitution algorithm: theory and application, World Scientific, ISBN 981-021777-3. 2. Andrew Adamatzky: Identif | |
| Bug Page(alife.jp.org) | www.alife.org's BUG PAGE -- Visit this site to get the latest alife news and alife free products! | Now we are collecting The Genetic Algorithm Software Resources! If You have, please tell us. If your Brouser is not support mailto URL, Click here. Cellular Automata Cellular Automata - includes Java applet examples. Concise Tutorial on Finite Automata Exploring the Space of Cellular Automata Fractals and Automata - fractal Julia Set generator and cellular automata exhibit. Notes on Artificial |
| CA Conferences | Conferences and workshops where papers on CA can be found Events mainly dedicated to CA MFCS workshop on cellular automata: 1998 ACRI (Automi Cellulari per la Ricerca e l'Industria): 1994, 1996, 1998 AUTOMATA (IFIP Workshop on Cellular Automata): 1996, 1997, 1998. deadline for submission: July 15 MoCA (Modeling with CA): 1998 Parcella: 1996 Others Euro-Par: 1997, 1998 FCT (Fundamentals of Computa | |
| CELLULAR AUTOMATA WALLPAPERS | CELLULAR AUTOMATA WALLPAPERS These images were created with the freeware Windows program Cellular Automata Laboratory (programmed by John Walker and Rudy Rucker, and originally published by AutoDesk as CA Lab). A Cellular Automata (CA) model consists of a grid of pixels, each having a colour state. Every pixel is periodically updated according to a mathematical rule involving its state and those | |
| CELLULAR-AUTOMATA | Categories Computer Science Research: General Academic Discussion_Name CELLULAR-AUTOMATA Topic The CELLULAR-AUTOMATA e-conference is for the discussion of topics relating to cellular automata, lattice gases, L systems, etc. Discussions on the list range from topics in the mathematical theory of CA such lattice gases, implementation/performance issues, and discussions of available CA software pack | |
| CSC Mathematical Topics: Cellular Automata | Visualization of cellular automata | Cellular Automata Visualizations - Home page - Help - End of the page - Changes - CSC - Comments Cellular automata are simple discrete dynamical systems. Here are a few animations of cellular automata (CA) made by Juha Haataja at CSC. 1D Cellular Automata There is a separate document containing visualizations of 1D cellular automata implemented in Java. 2D Cellular Automata Animation of a 2D cell |
| Cellular Automata | Cellular Automata General CA resources Frequently Asked Questions About Cellular Automata Life and its relatives Small spaceships under various rules How to kill a rectangle Paul Callahan's Page of Conway's Life Miscellany Chris Pressey's wwwLife page Robert T. Wainwright's LifePage Other CAs Ants Bugs by Keith Wiley CA software StarLogo Macintosh Artificial Life Software Back to Rich Holmes's pa | |
| Cellular Automata | Cellular Automata Cellular automata are discrete dynamical systems whose behaviour is completely specified in terms of a local relation. A cellular automaton can be thought of as a stylised universe. Space is represented by a uniform grid, with each cell containing a few bits of data; time advances in discrete steps and the laws of the "universe" are expressed in, say, a small look-up table, thro | |
| Cellular Automata | Cellular Automata | Next: Frequently Asked Questions About Up: Web sites Previous: Extend Cellular Automata Frequently Asked Questions About Cellular Automata A tutorial on Cellular Automata The BITMed (Laboratory for Biological Informatics and Theoretical Medicine) Cellular Automata page David Griffeath's Primordial Soup Kitchen Stephen Wolfram's Collected papers on Cellular Automata and Complexity Graphics Appli |
| Cellular Automata | Cellular Automata Basics Cellular automata are self-generating computer graphics movies. The most important near-term application of cellular automata will be to commercial computer graphics; in five years you won't be able to watch television for an hour without seeing some kind of CA. Three other key applications of cellular automata will be to simulation of biological systems (artificial lif | |
| Cellular Automata | Cellular Automata General CA resources Frequently Asked Questions About Cellular Automata Life and its relatives Small spaceships under various rules How to kill a rectangle Paul Callahan's Page of Conway's Life Miscellany Chris Pressey's wwwLife page Robert T. Wainwright's LifePage Other CAs Ants Bugs by Keith Wiley CA software StarLogo Macintosh Artificial Life Software Back to Rich Holmes's pa | |
| Cellular Automata | Cellular Automata | Next: Selected Packages in Up: The Fundamental Algorithms Previous: Evolutionary Algorithms Cellular Automata A cellular automaton is a discrete dynamical system. Space, time, and the states of the system are discrete. Each point in a regular spatial lattice, called a cell, can have any one of a finite number of states. The states of the cells in the lattice are updated according to a local rule. |
| Cellular Automata Applications | Graphics Applications of Cellular Automata RD Texture generation (Y.Takai, N.K.Takai, and K.J.Nakamori: "Exploration of the reaction-diffusion textures", Proc. Int. Conf. on Modelling and Simulation , 1998) Artificial evolution of RD textures (jpeg 57KB) Maze formation (mpeg 120KB) Zebra formation (mpeg 69KB) Virtual clay modeling (H.Arata, Y.Takai, and T.Yamamoto: "Virtual clay modeling based on | |
| Cellular Automata Pages at LIIN | The Cellular Automata Pages These are some WWW pages on Cellular Automata. If you have suggestions for improvements or additions, please let me know. Several people have already provided help; see the acknowledgements for a complete list. IFIP Working Group 1.5 The home page of the IFIP Working Group 1.5 on Cellular Automata and Machines. Software This list includes packages for the simulation of | |
| Cellular Automata Repository | Cellular Automata Repository CARD N. 25 Last Updated: September 1997 Cellab Rudy's Cellular AutomataJohn's Cellular Automata Classification Identification Installation Usage Notes Classification Top CA type 1-d, 2-d Application field General purpose Complexity High. In RC is possible to define user rules. In JC is possible to set paramaters. Rules type The programs include many predefined rules. | |
| Cellular Automata and Complexity: CollectedPapers | Contents Part 1: Primary Papers Statistical Mechanics of Cellular Automata Algebraic Properties of Cellular Automata Universality and Complexity in Cellular Automata Computation Theory of Cellular Automata Undecidability and Intractability in Theoretical PhysicsTwo-Dimensional Cellular Automata Origins of Randomness in Physical Systems Thermodynamics and Hydrodynamics of Cellular Automata Random | |
| Cellular Automata as Models of Complexity (1984) | Cellular Automata as Models of Complexity (1984) Abstract Main Text Cellular Automata Applications Mathematical Approaches Entropies and Dimensions Information Propagation Thermodynamics Formal Language Theory Computation Theory References Reference: S. Wolfram: Nature, 311, (October 1984) 419--424 Previous paper by date | Next paper by date Back to the main page Send comments or suggestions abou | |
| Cellular Automata as Simple Self-Organizing Systems (1982) | Cellular Automata as Simple Self-Organizing Systems (1982) Abstract Introduction Simple Initial States Random Initial States Global Properties Conclusions References Note Reference: S. Wolfram: Caltech preprint CALT-68-938 Previous paper by date | Next paper by date Back to the main page Send comments or suggestions about this site to sw-web@wolfram.com. Copyright (C) 1996, 1997, 1998 Stephen Wol | |
| Cellular Automatas and Artificial Life | Cellular Automatas Here is a small number of programs related to the Cellular Automata Machines, that includes some cyclic cellular automatons and simple rules such as the mod rule and the wireworld rule. If you want to know more about cellular automata, better to see the CA FAQ in the Santa Fe Institute. All programs runs in EGA and VGA. The programs of this web pages where presented in The Prim | |
| Cellular Automatas, Fractals & Vista Pro | Cellular Automatas, Fractals & Vista Pro The following images are made with Vista Pro, a program that renders landscapes via Digital Elevation Models (DEM). In this case, since I never know how to make a DEM, I user my fractal programs to generate a GIF file that contains the elevation data from diferent fractals, then I use LView to convert the file to PCX and then it is converted to DEM via Vis | |
| Cellular Automaton | Cellular Automata (1947-present) Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step | |
| Cellular automata consists of... | Slide 4 of 53 | |
| Cellular automata on subshifts | Cellular automata on subshifts | Next: Cellular automata on circle Up: Cellular automata with almost Previous: Introduction Cellular automata on subshifts Let A be a finite set and consider the space with the product topology. The set A is called the alphabet, the configuration space, and points in are called configurations. Let act on by translation: . A cellular automaton is a continuous map on such that for all . By the Curti |
| Chaosynth Index | This page is no longer available. For more info on Chaosynth please look at: Chaosynth (Unix/Linux) Chaosynth (Windows 95 - commercial version) | |
| Class Paint3d | Class Paint3d java.lang.Object | +----java.lang.Thread | +----Paint3d public class Paint3d extends Thread Class controlling painting of animated 3D logo. This code is not at all generic so there. But I am peased to say thay many oter classes are. @author Tim Lambert @menace Simon Horman Paint3d(Parameters, cselogo, Mousedelta) A drawable area containing a grif of cel | |
| Computation Theory of Cellular Automata | Computation Theory of Cellular Automata Summary: Self-organizing behaviour in cellular automata is discussed as a computational process. Formal language theory is used to extend dynamical systems theory descriptions of cellular automata. The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages. Many examples are g | |
| Computer & Graphics (1989) | Complex Patterns Generated By Next Nearest Neighbors Cellular Automata W. Li Computer & Graphics, 13(4), 531--537 (1989) Abstract A greater number of complicated patterns can be produced by cellular automata rules with next nearest neighbors in the updating, than those with only nearest neighbors couplings. Some patterns can be identified as gliders moving on the background, while other rules hav | |
| Critical connectivity | Critical connectivity in cellular automata This series of images illustrates the effect of connectivity on invasion percolation in a cellular automaton. Suppose that the cellular automaton represents an epidemic (for example, spread of a disease) or flow through a medium (for example, water seeping through porous rock). Then the 'active' sites might represent susceptible plants in a field, or cav | |
| DBLP: Bruno Durand | Bruno Durand List of publications from the DBLP Bibliography Server Home Page Bruno Durand: Tilings and Quasiperiodicity. ICALP 1997: 65-75 Bruno Durand: Self-Similarity Viewed as a Local Property via Tile Sets. MFCS 1996: 312-323 Bruno Durand, Jacques Mazoyer: Growing Patterns in 1D Cellular Automata. FCT 1995: 211-220 Bruno Durand: A Random NP-Complete Problem for Inversion of 2D Cellular Autom | |
| DII - Parma Cellular Automata master page | DII - Parma Cellular Automata master page Dana Eckart's CA Definition Time synchronous Cellular Automata (CA) are ideally suited for parallel processing, and have been characterized as `embarrassingly easy' to parallelize. The abstract CA execution model consists of: a possibly infinite n-dimensional lattice of cells; a finite alphabet from which the state of each cell is chosen; simultaneous upd | |
| Don's Cellular Automata Gallery | Don's Cellular Automata Gallery I've written code to play with real time animated cellular automata, that applies a bunch of rules to different parts of an image at once. You can create and delete different rules, move them around and resize them, throw them so they bounce around and leave trails, overlap them to mix their effects together, zoom into the cells and scroll around, and draw into the | |
| EvCA Project | Evolving Cellular Automata (EvCA) The EvCA Project How does evolution produce sophisticated emergent computation in systems composed of simple components limited to local interactions? In this project we are constructing models of such processes, using genetic algorithms to evolve cellular automata to perform computational tasks requiring globally-coordinated information processing. We are attemp | |
| Exploring the Space of Cellular Automata | Exploring the Space of Cellular Automata Here you can explore the space of cellular automata (CA), using a sequence of interactive pages for generating CA with certain properties, by tuning some parameters. Description of the 1-D cellular automata (CA) exploration pages: The elementary CA form allows you to explore the simpliest CA, those with one spatial dimension, two possible states per cell, | |
| Exploring the Space of Cellular Automata | References 1 C.H. Bennett, in Emerging Syntheses in the Sciences, Ed: D. Pines. (Addison-Wesley, Redwood City, 1988) S. Lloyd and H. Pagels, Ann. Phys. (N.Y.) 188:186 (1988) 2 N. Boccara, J. Nasser, and M. Roger. Annihilation of defects during the evolution of some one-dimensional class-3 deterministic cellular automata, Europhysics letters., 13(6):489, (1990) 3 N. Boccara, J. Nasser, and M. Roge | |
| FRACTINT cellular type | Cellular Automata Cellular Automata (type=cellular) These fractals are generated by 1-dimensional cellular automata. Consider a 1-dimensional line of cells, where each cell can have the value 0 or 1. In each time step, the new value of a cell is computed from the old value of the cell and the values of its neighbors. On the screen, each horizontal row shows the value of the cells at any one time. | |
| Further reading | Further reading | Next: Multi-agent models Up: Cellular Automata Previous: Other rules Further reading The best general introductions to the use of cellular automata in the social sciences are Hegselmann, R. (1996) `Cellular automata in the social sciences: perspectives, restrictions and artefacts' in R. Hegselmann, U. Mueller and K. G. Troitzsch (ed.) Modelling and simulation in the social sciences from the philo |
| Games of Proto-Life in Masked Cellular Automata (MCA) | Games of Proto-Life in | Next: Introduction Games of Proto-Life in Masked Cellular Automata (MCA) Syed Mustafa Ali and R. M. Zimmer Brunel University Uxbridge UB8 3PH England (UK) Email: Syed.Mustafa.Ali@brunel.ac.uk Abstract: We investigate a relativistic variant of Conway's Life rule in the context of two-dimensional cellular automata with neighbourhood templates defined by lattice geometry. The Proto-Life rule is base |
| IDENTIFICATION OF CELLULAR AUTOMATA | From owner-cellular-automata@Think.COM Wed Jul 19 20:29 MET 1995
Received: from Hugo.espci.fr by hp750 with SMTP
(1.38.193.4/16.2) id AA03958; Wed, 19 Jul 1995 20:27:33 +0200
Return-Path: | |
| Interesting CA Links | Links to further information on CA The following links are sorted by the last names of the authors/editors/maintainers of the corresponding pages. Of course, such a list a never complete .... Paul Callahan: Patterns, Programs, and Links for Conway's Game of Life Ariel Dolan et al.: Web Interactive Cellular Automata Rafael Espericueta: Dynamics of Cellular Automata David G. Green: Cellular Automat | |
| Introduction | Introduction | Next: Cellular automata on subshifts Up: Cellular automata with almost Previous: Cellular automata with almost Introduction A one-dimensional cellular automaton is usually viewed as a rule that gives a time evolution to configurations , where A is a finite set, by where r is the range of the automaton. We will consider cellular automata as shift commuting maps on the space of shift-invariant subs |
| Introduction | Introduction | Next: MEAN FIELD THEORY Up: No Title Previous: No Title Introduction A fundamental problem in the theory of cellular automata is classification . A good classification divides cellular automata into groups with meaningfully related properties. In general there are two types of classifications: phenotypic and genotypic[2]. A phenotypic classification divides a population into groups according to t |
| Kanada's Cellular Automata Home Page | Kanada's Cellular Automata Home Page This page is freezed. Updated information may be available at the new cellular automata home page. Created: 8/??/94, Modified: 9/14/97. Kanada's Papers Lists of Papers In English In Japanese A List of all the papges including other research areas are here. Hypertext papers Randomized Asynchronous Cellunar Automata (RACA) Paper by Kanada A Shorter Version of RA | |
| Lafe Technologies - Cellular Automata Transforms Technology | Lafe Technologies is committed to the exploitation of Cellular Automata Transforms for fast encryption, compression, modeling, and pattern recognition, among many other applications. | On The Horizon Applications The Lafe System The CAT FAQ Cellular Automata Transforms is a new development in the world of Cellular Automata. It has the potential to impact a multitude of important fields of technology including compression, encryption, modeling and much more. Here you can find out more about Cellular Automata Transforms, the types of things we are doing with them, as well as see |
| Lafe Technologies - Cellular Automata Transforms Technology | Lafe Technologies is committed to the exploitation of Cellular Automata Transforms for fast encryption, compression, modeling, and pattern recognition, among many other applications. | Lafe Technologies is committed to the exploitation of Cellular Automata Transforms for fast data compression, data encryption, pattern recognition, modeling, and many other applications. Cellular Automata Tranforms have the ability to adapt to the peculiarities of any given problem. The integer-based characteristics of the computational process make encryption, compression, pattern recognition an |
| LifeLab | by Andrew Trevorrow LifeLab is a Mac application for exploring John Conway's "game" of Life and other 2D cellular automata. Cellular automata were first studied in the mid-1950s by Stanislaw Ulam and John von Neumann. The subject became much more widely known in 1970 when Life was described by Martin Gardner in his Scientific American column. Life is played on an arbitrary-sized grid of square ce | |
| MFCS'98 Workshop on Cellular Automata | MFCS'98 Workshop on Cellular Automata A Satellite Workshop to MFCS'98 August 25-27, 1998, Brno, Czech Republic The Aim Cellular Automata have attracted a lot of attention recently. Progress has been made in several areas and new topics have been brought up for further research. The aim of the workshop is to allow for an exchange of ideas, to highlight new approaches and results (as well as proble | |
| Nick Holmberg's Research Page | Nick Holmberg's Research Page Contents of this web page: What I am up to! Nick Holmberg and Emile Massaad's Nanostructure Research Group Annual Report -- 1995. Nick Holmberg's Nanostructure Research Group Annual Report -- 1994. Why study Cellular Automata? Other people, groups, and misc. web pages in the Cellular Automata Arena. Currently I am reading many articles, books, and journals that may c | |
| PPT Slide | Slide 1 of 53 | |
| Package: areas/ca/faq/ | CMU Artificial Intelligence Repository Cellular Automata FAQ: Frequently Asked Questions About Cellular Automata areas/ca/faq/ A compendium of answers to frequently asked questions about Cellular Automata and related topics. Posted to the comp.theory.cell.automata newsgroup. See Also: http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html Origin: sfi.santafe.edu:/pub/CA/ | |
| Re: Fractals, Cellular Automata, and Encryption | [Date Prev][Date Next] [Chronological] [Thread] [Top] Re: Fractals, Cellular Automata, and Encryption To: tcmay@got.net Subject: Re: Fractals, Cellular Automata, and Encryption From: abostick@netcom.com (Alan Bostick) Date: Sat, 09 Mar 1996 15:35:09 -0800 Cc: cypherpunks@toad.com In-Reply-To: | |
| Searching for Chaos in Cellular Automata: New Tools for Classification | Searching for Chaos in Cellular Automata: New Tools for Classification | Next: Introduction Searching for Chaos in Cellular Automata: New Tools for Classification Paola Flocchini School of Computer Science Carleton University Ottawa K1S 5B6, Canada Email:flocchin@scs.carleton.ca Frédéric Geurts Départment d'Ingénierie Informatique Université Catholique de Louvain Place Sainte Barbe 2 B1348 Louvain-la-Neuve, Belgium Email: gf@info.ucl.ac.be Abstract: We present new too |
| Seecell | A picture I made Click here to see the inverse of this picture (107k) Description This is a one dimensional cellular automata. The update rule is that the color of each cell is the average of the color of it and it's neighbors on the preceding generation, plus a small random amount. Colors that become too large (too light) overflow and get reset back to zero. This is related to the coloring algor | |
| Self Reproducing Cellular Automata Loops | ||
| Software for CA | Software for CA These pages are the WWW version of section 4 of my technical report 37/96 on programming environments for cellular automata. It contains a list of software packages (mostly) for the simulation of CA. Of course this list is incomplete. If you have further informations concerning either the already listed packages or additional ones (maybe yours :-) which you want to be included in | |
| Stephen Wolfram: Articles on Cellular Automata | Cellular Automata as Simple Self-Organizing Systems (1982) Statistical Mechanics of Cellular Automata (1983) Cellular Automata (1983) Geometry of Binomial Coefficients (1984) Algebraic Properties of Cellular Automata (1984) Universality and Complexity in Cellular Automata (1984) Preface to Cellular Automata: Proceedings of an Interdisciplinary Workshop (1984) Computation Theory of Cellular Automa | |
| Suggested Reading | Suggested Reading: CA and the lambda Parameter (chronological order) C. Walker and W. Ashby, On temporal characteristics of behavior in a class of complex systems , Kybernetik 3(1966) 100-108. C. G. Langton, Studying Artificial Life with Cellular Automata , Physica D 22: 120-149, (1986) Interesting "Methods for Designing 'Interesting' Cellular Automata, H. Gutowitz and C. Langton. CNLS News Lette | |
| Susan Stepney's Acorn User articles | Acorn User articles Acorn User is a publication dedicated to Acorn's family of microcomputers: initially the Atom, then the famous BBC microcomputer, followed by the powerful Acorn Archimedes, and now the RISC-PC. I bought my first BBC micro in 1983, and was fascinated by the spectacular fractal effects that I could generate with very short programs. And programs that short are ideal for publishi | |
| TUTORIAL NOTES - cellular automata | Copyright David G. Green 1993. This preprint may be copied and used provided that this notice and the authorship details remain attached. CELLULAR AUTOMATA David G. Green, Environmental and Information Sciences, Charles Sturt University Introduction The increasing prominence of computers has led to a new way of looking at the world. This view sees nature as a form of computation. That is, we | |
| The ACP thematic | ACP: set of themes Cliquez ici pour avoir une version française. The group ACP studies the Fundamental Computer Science notions related to uniform nets of processors. Different notions of uniformity, process, communications are considered. Uniformity espacially concerns automata networks called cellular automata. Besides the usual nets as the line, the grid, and more generally Z^d, Cayley graphs | |
| The World-Wide Web Virtual Library: Complex Systems | Virtual Library of Complex Systems resources | © Charles Sturt University, 1995-8 "Complex systems" concerns the nature and consequences of interactions and non-linearities in systems of many objects. It includes topics such as artificial life, cellular automata, chaos, criticality, evolutionary computation, fractals, parallel computation, self-organization." Contents: Virtual Library - Registration - Search - Related Libraries - Links |
| Thomas Worsch's home page | Thomas Worsch's home page Email: worsch@ira.uka.de Phone: ++49 721/608-4311 Room: 025 (Bld. 50.34) Here you can find my exact addresses, phone and fax numbers and a photo. Lemma: A WWW home page is always under construction. Proof: By inspection. Contents [Research] [Papers] [Books] [Courses] [Studien- und Diplomarbeiten] [Organizational activities] [Miscellaneous] Research My main interests are | |
| Thomas Worsch's theoretical research page | Theoretical research This page is extended from time to time. Together with Alf-Christian Achilles (ACA), Martin Kutrib (MK), Daniel Merkle (DM), Frank Reischle (FR), Jürgen Ruf (JR), Heinrich Rust (HR), Peter Sanders (PS), Roland Vollmar (RV) and Jiri Wiedermann (JW) we (were or) are doing research concerning the following topics complexity theory for (classical) cellular automata, including: co | |
| Topic: areas/ca/ | CMU Artificial Intelligence Repository Cellular Automata areas/ca/ faq/ Cellular Automata FAQ: Frequently Asked Questions About Cellular Automata mail/ Mail archives for the CA mailing list systems/ Cellular Automata Packages See Also: areas/genetic/ areas/alife/ Origin: FTP repositories for cellular automata include sfi.santafe.edu:/p | |
| Topic: areas/ca/systems/ | CMU Artificial Intelligence Repository Cellular Automata Packages areas/ca/systems/ cam/ CAM: Cellular Automata Simulator cdm/ CDM: Interpreter for a cellular automata programming language. cellsim/ Cellsim: Cellular automata simulator. cinc/ Cinc: The NeXT Creatures Simulator dtr/ DTR: Simple Systems Exhibiting Self-Directed | |
| Topic: areas/ca/systems/ | CMU Artificial Intelligence Repository Cellular Automata Packages areas/ca/systems/ cam/ CAM: Cellular Automata Simulator cdm/ CDM: Interpreter for a cellular automata programming language. cellsim/ Cellsim: Cellular automata simulator. cinc/ Cinc: The NeXT Creatures Simulator dtr/ DTR: Simple Systems Exhibiting Self-Directed | |
| Universality and Complexity in Cellular Automata | Universality and Complexity in Cellular Automata Cellular automata are discrete dynamical systems with simple construction but complex self-organising behaviour. Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes. Characterisation of the structures generated in these classes are discussed. Three classes exhibit behaviour analogous to limi | |
| Untitled | Papers accepted for a FULL PRESENTATION at the conference: Maja Malus DIAGNOSTIC SYSTEM STOMSYS Salah Badjou ULTRASONIC MEASUREMENT OF POSTURAL STABILITY AND CONTROL Nasser Kaspari USNIG AN ARTIFICIAL NEURAL NETWORK TO DEFINE THE PLANNING TARGET VOLUME IN RADIOTHERAPY Bozidar Potocnik Automated Computer-Assisted Detection of Follicles in Ultrasound Images of Ovary Gerald Krell ENHANCEMENT AND | |
| /alife/topics/cas/ca-faq/aux/adam.txt | From owner-cellular-automata@Think.COM Wed Jul 19 20:29 MET 1995
Received: from Hugo.espci.fr by hp750 with SMTP
(1.38.193.4/16.2) id AA03958; Wed, 19 Jul 1995 20:27:33 +0200
Return-Path: | |
| Untitled | CelLab: Cellular Automata Laboratory Public Domain Program by John Walker and Rudy Rucker Cellular Automata Laboratory is the Windows version of a package originally called CA Lab and sold by Autodesk, Inc. The main CelLab program JC.EXE was written by John Walker and includes some rules by Rudy Rucker. Enjoy it, back at last, the fastest and best 2D cellular automata program ever written! SEEK Y | |
| /software/mac/lifeSciences/Automata/Automata.abstract | Automata.sea.hqx Cellular Automata Ken Wessen Department of Physics Prince of Songkla University Hat-Yai, Songkla Thailand 90112 ken@sritrang.psu.ac.th From the author's description: " A cellular automata consists of a lattice of | |
| Why Cellular Automata? | Next: Rudy's Answer Up: The Autodesk File Previous: Generic Software Acquisition Why Cellular Automata? I met Rudy Rucker at the Hackers' Conference in 1987. I'd read most of his books, but I didn't know he'd gotten into computers. He brought a PC with a CAM-6 board, a hardware cellular automata simulator, and showed some amazing demos. After I got back from Hackers' I thought more and | |
| Yahoo! Canada - Science:Artificial Life:Cellular Automata | Top:Science:Artificial Life:Cellular Automata Options Search: All sites Canadian sites only This category only Capow - research group at San Jose State University on evolving complex cellular automata for electric power grid simulation. Cellular Automata - includes Java applet examples. Exploring the Space of Cellular Automata FAQ - Cellular Automata Fractals and Automata - fractal Julia Set | |
| Yahoo! UK & Ireland - Science:Artificial Life:Cellular Automata | Top:Science:Artificial Life:Cellular Automata Options Search: All sites UK & Ireland sites only This category only Capow - research group at San Jose State University on evolving complex cellular automata for electric power grid simulation. Cellular Automata - includes Java applet examples. Exploring the Space of Cellular Automata FAQ - Cellular Automata Fractals and Automata - fractal Julia | |
| ZPR-Publications: branch-and-bound | ZPR-Publications: branch-and-bound ZPR-Publications Overview 97-302: Exakte Algorithmen f\ür orthogonale Packungsprobleme J. Schepers Abstract Paper: gzipped ps , zipped ps , ps 97-268: Verbundprojekt PARALOR: Parallele Verfahren zur Wegoptimierung in Flugplanung und Logistik A. Bachem , M. Bodmann , G. Bolz , T. Emden-Weinert , A. Erdmann , B. Monien , M. Kiahaschemi , H. J. Pr\ömel , J. Scheper | |
| en:att/math/odlyzko/cellular.automata.ps | file: att/math/odlyzko/cellular.automata.ps title: Algebraic Properties of Cellular Automata by: O. Martin, A. M. Odlyzko, and S. Wolfram has: been reprinted in "Theory and Applications of Cellular Automata,": S. Wolfram, ed., World Scientific, 1986, pp. 51-90, and: in "Cellular Automata and Complexity: Collected Papers of: Stephen Wolfram," Addison-Wesley, 1994, pp. 71-113. This: version is | |
| home page of IFIP WG 1.5 | Welcome to the home page of Working Group 1.5 Cellular Automata and Machines Aims and scope WG 1.5 is subordinated to Technical Committee 1 (Foundations of Computer Science) of the International Federation for Information Processing (IFIP). The mission of the working group is to support the development of cellular automata theory and their applications (especially in parallel computing, in the st | |
| Applications of Complexity Theory to Academic and Business fields assembled by CALResCo | Links to uses of complexity theory and self-organisation concepts in | Applications of Complexity Theory to Academic and Business fields Art Biology Business Chemistry Economics Education Games Genetics Literature Management Maths Medicine Music Philosophy Physics Psychology Sociology Technology (many more technical applications can be found within the links listed on the Online and Offline Paper pages and within the CA, EC & NN FAQs. Additional suggestions for this |
| Artificial Intelligence News Groups | Artificial Intelligence News Groups If you have something you would like added to this list, please let me know. If you came to this page directly from outside, you might want to take a look at our general AI Resource page. The following News Groups are directly related to AI: comp.ai - general AI comp.ai.alife - artificial life comp.ai.edu - education comp.ai.fuzzy - fuzzy logic comp.ai.games - | |
| Bud's Fractal Pages | This site contains IFS fractal images and cellular automata | Bud's Fractal Pages Stargate What's New on this site as of 18 April 1998 Art: Exhibits | Fractint Galleries | Rogue's Gallery (vacant) | Art for Sale Words: About fractal art | What are fractals? | Notes on the images Me: Who am I? | Hire me! (my resume) Links: Favorite Sites | Books on fractals This site includes several fractal types: Iterated Function Systems (IFS) z2 (Mandelbrot) - standard a |
| Centre for Teaching Computing...Meitheal (Newsletter 3, 1) | Centre for Teaching Computing, Meitheal (Newsletter 3, 1) November, 1994 Report on Windows 3.1 Programming, 28/10/1994 Windows 3.1 Programming was held at Tallaght RTC and Presented by John O’Duinn, Quay Financial Software. 14 lecturers/students from Irish third level institutions attended the seminar. Future Seminars Fri. 25 Nov. - RTC Tralee Mathematica | |
| Come on in my kitchen ... | You better come on in my kitchen. It's going to be raining outdoors. -- Robert Johnson Hi there. I'm a math prof at the University of Wisconsin - Madison whose research these days focuses on self-organization of random cellular automata. For the past ten years or so I have been producing colorful computer graphics and animations that illustrate the ability of local parallel update rules to genera | |
| Contours of the Mind - Exhibition page | Contours of the Mind A Celebration of Fractals, Feedback and Chaos. An exhibition of Sonic and Visual Art at the Australian National University Drill Hall Gallery 23 June - 24 July 1994 Discontiuum II Contours of the Mind - a celebration of fractal geometry, feedback and chaos. The event has brought together a unique blend of visual art, science and music, which was exhibited at the ANU Drill Hal | |
| CSC Mathematical Topics: Visualizations | Mathematical visualizations and animations | Mathematical visualizations and animations These samples are chosen to provide some samples of the visualizations and animations done by the application specialists on mathematics at CSC. Linear algebra Differential equations Fourier series Optimization Genetic algorithms Cellular automata DLA clusters Hyperbolic geometry The Klein bottle To view the animations, you need a program capable of disp |
| David Eppstein | David Eppstein I am a full professor in the Department of Information and Computer Science, UC Irvine. In a previous life I perpetrated hacks such as a multiwindowing package in Teco for ITS Emacs; nowadays I just sit around and think. My main research interests are graph algorithms and computational geometry. My other interests include architecture, cartography, chess, genealogy, pinball, recrea | |
| David Geoffrey Green | [Bottom] David G. Green Research Interests Complex systems (connectivity, cellular automata, evolutionary processes); Landscape ecology; Bioinformation, including International Organizaton for Plant Information and Biodiversity Information Network Australian Biological Research Network Curriculum Vitae List of publications Network activities Established Australia's first official World Wide Web s | |
| DBLP: Yves Métivier | Yves Métivier List of publications from the DBLP Bibliography Server Anne Bottreau, Yves Métivier: The Kronecker Product and Local Computations in Graphs. CAAP 1996: 2-16 Yves Métivier, Nasser Saheb: Medians and Centres of Polyominoes. IPL 57(4): 175-181 (1996) Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier: Computing the Closure of Sets of Words Under Partial Commutations. ICALP 1995: 7 | |
| Forum Internet Resource Collection - Math by Topic | Forum Internet Resource Collection Mathematics About the Collection || Table of Contents || Search the Collection || Current Hot Spot Mathematics on the Internet - By Topic About Numbers Abstract Algebra Algebra Analysis Arithmetic Calculus Cellular Automata Chaos Combinatorics Computational Geometry Computational Science Differential Geometry Discrete Math Dynamical Systems Fluid Dynamics Fourie | |
| Fractals on the TI-92 | Member of the Internet Link Exchange Announcement I am looking to sell my TI-92 and find someone to be in charge of "Fractals on the TI-92" in the future. I had intended for the same person to do both of these. The person who becomes in charge of this page would have the entire page's content at their discretion, I would not involve myself unless I was asked to be. I would also give the person th | |
| Graphics Sites on the Net | Graphics Sites on the Net, plus clipart, desktop publishing, fonts, web authoring, and much more | Click here and download Adobe ImageReady now. 3D Site Site dedicated to 3D Computer Graphics. 3D Visions Provides expert creative computer generated visualizations. Air Force Institute of Technology Computer Graphics Research in design and implementation of virtual environments, distributed interactive simulations, and advanced distributed simulations for military and medical uses. Army Resear |
| gumby.syr.edu | Welcome You can get the source code here for the X-Windows Stochastic Spatial Simulator, s3, maintainted by Ted Cox and Rick Durrett. You may want to check out the short README file, or the longer TeX document README.tex (also in postscript README.ps or dvi README.dvi format). Then get the s3 distribution s3.tar.Z or s3.tar.gz, and check out the user contributed models below. There is now a new t | |
| Homepage of Mark Land | Mark Land On-Campus: AP&M 4859 / UCSD CSE 0114 / La Jolla, CA 92093-0114 mland@ucsd.edu Interests discrete optimization, artificial intelligence, genetic algorithms, cellular automata, artificial life, evolution, neural networks, cognitive science, complex systems, backgammon, interesting games Current Research Investigation of the interaction between global and local search methods in hybrid alg | |
| LIFE - 404 Error - File not Found | What's New About This Service Australia Biological Information Complexity Education Environment Organisations Heritage Find Information LIFE Publications Centre Frames 404 Error - File not Found Sorry the file for which you were looking does not exist. Please check that the URL (address) is correct. The URL you tried was: http://complex.csu.edu.au/complex/green.html You followed this link fro | |
| Informatics for Engineering and Science | Informatics for Engineering and ScienceUniversity of Karlsruhe Address Lehrstuhl Informatik für Ingenieure und Naturwissenschaftler Universität Karlsruhe Am Fasanengarten 5 76128 Karlsruhe, Germany Tel: ++49 (0)721 608 4333 Fax: ++49 (0)721 69 86 75 Official page (german) People Bibliographies This is the home of the Computer Science Bibliography Collection. Cellular Automata This is the home of | |
| Informatics for Engineering and Science | Informatics for Engineering and ScienceUniversity of Karlsruhe Address Lehrstuhl Informatik für Ingenieure und Naturwissenschaftler Universität Karlsruhe Am Fasanengarten 5 76128 Karlsruhe, Germany Tel: ++49 (0)721 608 4333 Fax: ++49 (0)721 69 86 75 Official page (german) People Bibliographies This is the home of the Computer Science Bibliography Collection. Cellular Automata This is the home of | |
| Jahresbricht 1995: Interne Berichte und Reports | Jahresbericht 1995Interne Berichte und Reports Interner Bericht / Report: Alt, J.; Fock, F.; Theobald, F.; Zimmer, W.: Aggregatklassen in OBST Interner Bericht / Report: Angele, J.; Studer, R.: Requirements Specification and Model-based Knowledge Engineering Interner Bericht / Report: Aßmann, U.: OPTIMIX Language Report for OPTIMIX 7.0 Interner Bericht / Report: Baer, D.; Benke, O.; Brueckner, T. | |
| John Conway's Game of Life | John Conway's Game of Life ...with apologies to Eric Bina. Follow this link to a brief description of the rules and a pointer to some other implementations. Warning: THIS IS NOT REALLY A GAME This is not really a game. It is an implementation of a cellular automata that John H. Conway chose to call "The Game of Life." It simulates the birth, death, etc., of organisms based on certain rules. If yo | |
| Lexicon | Definitions and explanations courtesy of (and much thanks to), Jim Crutchfield and Tom Humphrey Bifurcation George Birkhoff Cellular Automata Catastrophe Theory Chaos Complexity Dynamical Analysis Balthazar Van der Pol ENIAC Fractals Kurt Godel Michele Henon A. N. Kolmogorov Edward Lorentz Non Linear Dynamics Benoit Mandelbrot Sante Fe Institute Shannon's Communication Theory State Space Strange | |
| Machine Learning List: Vol. 9, No. 9 | [Next][Index] Machine Learning List: Vol. 9, No. 9 To: ML-LIST: ; Subject: Machine Learning List: Vol. 9, No. 9 From: Michael Pazzani | |
| Net Tribes - Fringe Science | Fringe Science Origins and Overview - Web starting points - Virtual Culture - Psychedelic Culture - Rave Culture - Cyberculture - Industrial Culture - PostModernism - Street Culture - Fringe Science - Social and Public Policy issues - Society - Cybersex - Censorship and Hackers - Future ? "new explanations for new realities. Cellular automata, chaos theory, singularity, maybe even quantum theory. | |
| /galist/digests/v11n20 | Genetic Algorithms Digest Thursday, June 12, 1997 Volume 11 : Issue 20 - Do NOT send email or reply to gadistr@aic.nrl.navy.mil (GA List Moderator) - Send submissions (articles) to GA-List@AIC.NRL.NAVY.MIL - Send administrative (subscribe, unsubscribe, change of address, etc.,) requests to GA-List-Request@AIC.NRL.NAVY.MIL ****************************************************************** | |
| /galist/digests/v6n33 | Genetic Algorithms Digest Thursday, September 24 1992 Volume 6 : Issue 33 - Send submissions to GA-List@AIC.NRL.NAVY.MIL - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL - anonymous ftp archive: FTP.AIC.NRL.NAVY.MIL (Info in /pub/galist/FTP) Today's Topics: - Moderator's Message; ftp access - Re: FOGA proceedings information - Re: (v6n31) Request for references on GA | |
| Pea Soup | Click on the URL, or wait a few seconds, to visit our new home : http://psoup.math.wisc.edu/kitchen.html KINDLY UPDATE YOUR PSK BOOKMARK. Pea Soup 2 C split peas 5 C chicken stock 5 C water 1/2 C chopped celery 1/4 C chopped carrots 1/4 C chopped onions 1 large ham hock 1 clove garlic 2 bay leaves 1 T Pickapeppa or Worcestershire sauce 1 t Crystal or Tabasco sauce salt and freshly ground white pe | |
| Research of Ignaz KOHLBECKER | Research Ignaz KOHLBECKER, Hiroyuki FUJITA: "Autonomous Distributed Systems in Micro Mechatronics - Evolving Controllers for a Cellular Part Conveyor" Research Overview, Open house of the Inst. of Industrial Science, Univ. of Tokyo Tokyo, Japan, June 1998 Ignaz KOHLBECKER, Manabu ATAKA, Hiroyuki FUJITA: "On the Control of Multi-Functional Micromodules" Proc. 3rd Meeting of the Biomimetic Systems | |
| reversible: Algebra of Rev 1D CA, part 1 | Algebra of Rev 1D CA, part 1 Timmy (k317370@alijku11.edvz.uni-linz.ac.at) 25 Apr 94 06:18:16-0400 Messages sorted by: [ date ][ thread ][ subject ][ author ] Next message: McIntosh Harold V.-UAP: "Re: Algebra of Rev 1D CA, part 1" Previous message: MikeAt1140: "Re: 1 dimensional reversible CA" Next in thread: McIntosh Harold V.-UAP: "Re: Algebra of Rev 1D CA, part 1" Well, thanks to all for the i | |
| The Kitchen Sink | Welcome To The Kitchen Sink A bouillabaisse of fave links for primordial cooking and stochastic karma DOWNLOAD WinCA Check out the final 16-bit version of WinCA, a Windows-based CA experimentation environment. See winca.txt for installation info. DOWNLOAD GASP Try Graphical Aids for Stochastic Processes, our EDUCOM award-winning interactive tutorial on stochastic processes. (DOS shareware in 6 mo | |
| Web Server Usage | Institute of Informatics - University of Giessen Web Server Usage Week of Sun Mar 31 00:00:00 1996 Total accesses: 506 Total index accesses: 0 Distribution by Domain: Accesses by top 10 domains: de: 282 com: 114 ?: 21 fr: 20 at: 20 jp: 18 edu: 17 ca: 10 ch: 3 za: 1 30 items accessed most: / 29 /cellular-automata-96 21 /cellular-automata-96/participants.html 9 /staff.html 9 /robots.txt 6 /theoriet | |
| Web Server Usage | Institute of Informatics - University of Giessen Web Server Usage Week of Sun Apr 14 01:00:00 1996 Total accesses: 1132 Total index accesses: 0 Distribution by Domain: Accesses by top 10 domains: de: 639 com: 154 ?: 108 ca: 27 net: 22 pl: 20 ie: 19 it: 19 ZDV: 18 jp: 18 30 items accessed most: / 57 /cellular-automata-96 37 /staff.html 24 /lehre.html 13 /staff/kutrib.html 11 /cellular-automata-96/ | |
| Welcome to BITMed | Welcome to the BITMed Simulation Server at the University of California, San Diego. This server is unique in that the WWW hypertext is interleafed with true complex systems simulations of biological, chemical and physical systems. We are presently building several virtual environments for the rational design of clinical trials and wetlab experiments. Our current simulators are invaluable tools fo | |
| Xtoys | Xtoys The directory xtoys contains a set of cellular automata simulators I have written for Xwindows. The executables here are for SunOS 5.4 (Solaris). The xtoys gallery shows lots of pictures produced by these programs (beware if you have a slow link). To peek at the xising user interface, look here. A further description of these files is in my contribution to the Lattice'95 proceedings. The fi | |
| JcaToi - Java Cellular Automaton implemented in Text Oriented Interactive mode | JcaToi (Text-Oriented-Interactive Java CA) is a Game-of-Life implementation that is contolled by the html text |
Ariel Dolan