Pusat Studi Cellular Automata

Author:

• Shashidhar Rampally

Content:

Overview and Problem Statement

Cellular Automata

Route-Planner Algorithm

Simulation using Cellular Automata

Experimental Analysis

Conclusions & Recommendations

Download:

• robot-planning-ca

Author:

• Tommaso Toffoli, MIT Laboratory for Computer Science, Cambridge, December 1994.

Content:

This is a introduction to cellular automata stressing their role as standard-bearers of an aggressive form of reductionism-which we may term “fine-grain modeling”. Cellular automata try to capture in abstract computational terms certain fundamental aspects of physics-such as uniformity, locality, and local finiteness.

Download:

• occam-turing-ca

Author:

1. V. Pavlidou, Department of Astronomy, University of Illinois at Urbana-Champaign, Urbana, USA, and Section of Astrophysics, Astronomy and Mechanics, Department of Physics, University of Tessaloniki, Greece.
2. J. Kuijpers, Astronomical Institute, Utrecht University, The Netherlands, and Department of Astrophysics, University of Nijmegen, The Netherlands.
3. L. Vlahos, Section of Astrophysics, Astronomy and Mechanics, Department of Physics, University of Tessaloniki, Greece.
4. H. Isliker, Section of Astrophysics, Astronomy and Mechanics, Department of Physics, University of Tessaloniki, Greece.

• Accepted 15 February 2001

Content:

In this paper we attempt, for the first time, to simulate the magnetic activity of an accretion disc using a probabilistic cellular automaton model. Our model is based on three free parameters, the probabilities of spontaneous and stimulated generation of magnetic flux below the surface of the disc, and the probability of diffusive disappearance of flux below the surface (D).

Download:

• magnetic-activity-ca

Author:

1. Wim Hordijk
2. James P. Crutchfield*
3. Melanie Mitchell

• Santa Fe Institute, Santa Fe, NM
• *Physics Department, University of California, Berkeley
  

Content:

In our work we are studying how genetic algorithms (GAs) can evolve cellular automata (CAs) to perform computations that require global coordination. The “evolving cellular automata” framework is an idealized means for studying how evolution (natural or computional) can create systems that perform emergent computation.

Download:

• embedded-particle-ca

Author

• Sachin Dhingra, ELEC 7250: VLSI Testing

Content

Built-In Self Test

- Circuit capable of testing itself

- Two major components

1. Test Pattern Generator
2. Output Response Analyzer

Implementation of BIST

- Linear Feedback Shift Register (LFSR)

• Shift Register with feedback path linearly related to the nodes using XOR gates

– Cellular Automata (CA)

• A collection of nodes logically related to their neighbors using XOR gates

Download

• bist-ca

Author

• Dr Robert H Barbour, Unitec, New Zealand

Content

Open Problems and Projects.

Six different mentions of ‘Gray Code’

One mention of exploring more than two colours in a cellular automaton.

Download

• 2D-ca

Author

1. Rikke Bendlin
2. Mia Grifford
3. Geetika Gupta
4. Klodiana Hajdari
5. Sarah Loos
6. Amy McNabb
7. Raquel Phillips
8. Crystal Reidinger
9. Elizabeth Thomas
10. Henry Cohn

Content

Cellular automata: a discrete model studied in computability theory, mathematics, and theoretical biology. Entropy: a measure of disorder or randomness in a closed system.

Entropy Window Sizes

Download

• experimental-math-ca

Author

• Nazim Fates, ENS Lyon-LIP, France

Content

Classifying cellular automata in order to capture the notion of chaos algorithmically is a challenging problem than can be tackled in many ways. We here give a classication based on the computation of a macroscopic parameter, the d-spectrum, and show how our classifying scheme can be used to separate the chaotic EAC from the non-chaotic ones.

Download

• Experiment-ca.ps