Skip to content

Simulate all 256 elementary cellular automata (CA)!

Notifications You must be signed in to change notification settings

danrpts/elementary_CA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

52 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Cellular automata

                                                         *                                                                 
                                                        ***                                                                
                                                       **  *                                                               
                                                      ** ****                                                              
                                                     **  *   *                                                             
                                                    ** **** ***                                                            
                                                   **  *    *  *                                                           
                                                  ** ****  ******                                                          
                                                 **  *   ***     *                                                         
                                                ** **** **  *   ***                                                        
                                               **  *    * **** **  *                                                       
                                              ** ****  ** *    * ****                                                      
                                             **  *   ***  **  ** *   *                                                     
                                            ** **** **  *** ***  ** ***                                                    
                                           **  *    * ***   *  ***  *  *                                                   
                                          ** ****  ** *  * *****  *******                                                  
                                         **  *   ***  **** *    ***      *                                                 
                                        ** **** **  ***    **  **  *    ***                                                
                                       **  *    * ***  *  ** *** ****  **  *                                               
                                      ** ****  ** *  ******  *   *   *** ****                                              
                                     **  *   ***  ****     **** *** **   *   *                                             
                                    ** **** **  ***   *   **    *   * * *** ***                                            
                                   **  *    * ***  * *** ** *  *** ** * *   *  *                                           
                                  ** ****  ** *  *** *   *  ****   *  * ** ******                                          
                                 **  *   ***  ****   ** *****   * ***** *  *     *                                         
                                ** **** **  ***   * **  *    * ** *     *****   ***                                        

What is this?

TODO

How to use this?

TODO

What is a cellular automaton?

A cellular automaton (CA) is an artificial lifeform. As compelling as this sounds, a CA is still a machine following simple rules. Informally, a CA is a set of finite state machines called cells. These cells communicate with one another to produce a new generation of cells with respect to time. Despite its simplicity, a CA can still exhibit behavior in the realm of chaos, order, and somehwere inbetween. The resulting complexity is precisely why they are of special interest.

What about Turing completeness?

Some cellular automata are Turing complete e.g. the elementary rule 110. This means all Turing machines can be simulated (all real-world computational problems can be solved) using cellular automata.

What is an elementary cellular automaton?

TODO

Any further reading?

TODO

About

Simulate all 256 elementary cellular automata (CA)!

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published