Cellular Automata

Sorry, I do noy know!

2. What applications does cellular automata have?

Applications of cellular automata (CA) are numerous ranging from artificial life to generation of cryptographic transformations. Basicaly, CA allows a bottom-up approach in generating virtual representation of complex real phenomena: 1.Maze generation http://madeira.cc.hokudai.ac.jp/RD/takai/Stripe.mpg 2.Virtual modeling http://madeira.cc.hokudai.ac.jp/RD/takai/Ex07.mpg 3.Hypertexture modeling http://madeira.cc.hokudai.ac.jp/RD/takai/hyperanim.mpg and check this one out http://en.wikibooks.org/wiki/Cellular_Automata/Applications_of_Cellular_Automata ____________________________________________ Roughly a cellular automata is a computational model of a dynamical system or a subsystem located on a uniform grid (or lattice) operating in a discreet space and time. What does it mean? It means that we have a system divided into about equal parts. These parts interacts with neighbors by providing outputs to some neighbors generated based on inputs of other neighbors. The outputs are also influenced by states the cell had when it received a particular input. Stanislaw Ulam and John von Neumann are the two mathematicians who originally pioneered the work in this area.

3. Can Cellular Automata be used to program computers?

Yes, it is possible. I'll give an example using the game of life. A glider can represent a pulse, and a glider gun can generate unlimited amount of pulses. By colliding of two gliders at exact time and position, logic gate, such as AND, OR, NOT, can be constructed. There is also ways to store numbers using still life. However, it would be very inefficient, as the previous answer pointed out.

4. Does anyone know of the existance of a Stationary Cellular Automata structure that emulates gravity?

First of all get this program called MCell http://www.mirekw.com/ca/index.html which is a freeware written to simulate various CA models. It also has various models included in it and of course you can define your own as well. One of the ones in it, I don't remember the name, does this gravity effect. It models falling grains of sand so when you pull out this model, you can of course look at the rules too and then see it in action. There are other ones to I believe. Just get the program and look through the models given Hope that helps.

5. Give me the name of the book in which i can get about topic Cellular automata?

1- Arbib, M. A. (1969). Theories of Abstract Automata. Englewood Cliffs, NJ: Prentice-Hall. 2- Arbib, M. A. (1987). Brains, Machines and Mathematics. Second edition. New York: Springer. 3- Arbib, M. A., Ed. (1995). The Handbook of Brain Theory and Neural Networks. Cambridge, MA: MIT Press 3- Chomsky, N. (1963). Formal properties of grammars. In R. D. Luce, R. R. Bush, and E. Galanter, Eds., Handbook of Mathematical 4- Handbook of Mathematical Psychology, vol. 2. New York: Wiley, Minsky, M. L. (1967). Computation: Finite and Infinite Machines. Englewood Cliffs, NJ: Prentice-Hall. 5- Post, E. L. (1936). Finite combinatory processes—formulation I. Journal of Symbolic Logic 1: 103–105. 6- Seidenberg, M. (1995). Linguistic morphology. In M. A. Arbib, Ed., The Handbook of Brain Theory and Neural Networks. Cambridge, MA: MIT Press. 6- Shannon, C. E., and J. McCarthy, Eds. (1956). Automata Studies. Princeton: Princeton University Press. 7- Turing, A. M. (1936). On computable numbers. Proc. London Math. Soc. I can't work the format when I post my answer, but I reposted the answer with numbers so it can be easy for you to look at.

6. Cellular Automata in a non-ridged universe?

It's been a long time since I studied them as an academic discipline. In practice, the grid is often 3, 4, or more dimensions. Software and hardware aren't limited by correspondence to physical reality. If such a construct is dynamically reconfigurable, I don't know if anyone would still call it a CA. It's hard to map real world problems into a structure like this, and the complexity exacts a cost. You can probably find what you're looking for, but it might not be defined or discussed in the same terms you used.

7. What is Quantum-Dot Cellular Automata?

It's not an easy subject, but there's work going on, largely at IBM, to try to use quantum phenomena to perform computations. Cellular automata refers to a field of computing theory dealing with computations done by arrays of computers. If someone figures out how to grow crystals of quantum dots and do useful computations with them, you'll have a tremendous amount of computing power in an extremely small space. Moore's Law will run out of steam as transistors shrink to a small number of atoms. The only alternate paths to further improvement that we've thought of so far are quantum or some other form of molecular computing.

8. Does the universe consist of cellular automata with cells defined by Heim theory and rules defined by E8 TOE?

Cellular automata, turing machines, and neural networks, are provably equivalent. I'm not so sure about E8 ToE but considering E8's prevelance elsewhere in mathematics and physics, it's certainly worth pursuing. It's certainly more parsimonious than string theory. It's too early to judge. E8 ToE makes some testible predictions that the LHC should be able to put to the test. I'll wait. Extra Sharp Kosher Cheddar (contains no rennet).

9. hi am doing project on hdl environment for quantum do cellular automata,plz any one having the idea about it p

Download Quartus Web Edition for free. You can write VHDL, Verilog or AHDL and run simulations on it.

10. Assuming equal complexity, would a level 5 CA become self-aware?

I think the reality is that a model of a human could occupy cellular automata. If you conceive of immortality as a persistent model of yourself, cool. Personally, mine involves survival of my consciousness--not a model of it.

11. Isn't the fact that systems with very simple rules make astronomically complex results evidence of evolution?

Of course. I am reading about increasing complexity and it's evolution, now. A paper on evo devo. ( evolutionary development )

12. Question about Conway's Life ?

I know what Conway's Game of Life is, but how do you define a lifetime for a Conway world? ____

13. Need Grammatical correction.?

skip to main | skip to sidebar primate Thursday, April 3, 2008 Cellular Automate Several days ago, I read an entry about Cellular Automation in Wiped, which links to a page titled Conway's Game of Life. In that page I learned that there is a simple rule in Cellular Automation, capable of generating complex pattern. Since I had been interested in the concept for a long time, I made the program yesterday (April 1st 2008). There are many rules, which can be used in a Cellular Automation program. A Cellular Automation's rule have to mention what neighborhood condition should be fulfilled, to make a cell born, unchanged, or dies. The image above for example, is generated using rule 1/1, which means that for each cell, having one neighbor is going to come to life, but will die of loneliness if it have no neighbor, or die of overcrowd if it have more than one neighbor. You can see the lexicon of rules, and the possible outcome in this Index of Rule. Gasper's Glider Gun (Rule 23/3) One of the pattern in Cellular Automation that I'm fond of is Gosper's Glider

14. Python Programming Problem?

Your init function should be named __init__ , not _init_ . All the special function names use two underscores in front/back rather than 1. When you attempt to call the constructor, it thinks _init_ is an ordinary function and doesn't actually find it as being the constructor.

15. Another Python Programming Problem?

16. Cellular Automata?

I wrote a very easy to understand tutorial at http://gamedesignideas.com/index.php/Cellular-Automata/Cellular-Automata-Tutorial-Part-I-Linear-CA.html That should answer some of your questions. Also, Stephen Wolfram has a good page on cellular automata. Check it out at : http://www.stephenwolfram.com/publications/articles/ca/ you can find all kinds of advanced papers on CA there.