# Team:ETH Zurich/project/background/modeling

(Difference between revisions)
 Revision as of 14:44, 12 September 2014 (view source)Eledieu (Talk | contribs) (Created page with "=== Cellular Automata === This pattern formation was formalized by Neuman in the concept of cellular automata. Following a simple pre-programmed logic rule, the state of a spot o...")← Older edit Latest revision as of 02:40, 18 October 2014 (view source)Lnadine (Talk | contribs) (→Cellular Automata) (14 intermediate revisions not shown) Line 1: Line 1: - === Cellular Automata === + == Pattern Formation == - This pattern formation was formalized by Neuman in the concept of cellular automata. Following a simple pre-programmed logic rule, the state of a spot on the shell, corresponding to the color (either white or brown), is determined by the states of three parent spots (from the previous computation round). Wolfram [[Team:ETH_Zurich/project/references#refWolfram|]] elaborated a whole theory on these cellular automata. + - [[File:ETHZurich_CAWolfram.jpg|300px|center]] + ==='''Cellular Automata''' === + Pattern formation was formalized by Neuman in the concept of cellular automata. Following a simple pre-programmed logic rule, the state of a cell is determined by the states of three parent cells (from the previous computation round). Those logic rules are discrete computations: they can be either implementing an AND logic gate or another rule. Wolfram [[Team:ETH_Zurich/project/references#refWolfram|]] elaborated a whole theory on these cellular automata. - According to cellular automata theory, emergent patterns offer a large panel of properties: striking examples are the rule 30 which gives an apparently random pattern and the rule 110 which has been proven to be Turing complete. With cellular automata, you cannot predict how the final pattern will look like even if you know the rule that governs its property. Thus the intricated computations of steps poses the problem of complexity. + [[File:ETHZurich_CAWolfram.jpg|300px|center|thumb| '''Figure 2''' Here are three different cellular automata with their logic rule [[Team:ETH_Zurich/project/references#refWolfram|]]]] + According to cellular automata theory, emergent patterns offer a large panel of properties: striking examples are the rule 30 which gives an apparently random pattern and the rule 110 which has been proven to be Turing complete. With cellular automata, you cannot predict how the final pattern will look like even if you know the rule that governs its property. Thus, the intricated computations of steps poses the problem of complexity. +
+
+ We chose to implement the XOR gate with two inputs, corresponding to rule 6. It can be considered as a first step towards the rule 110, which is an XOR with 3 inputs and is known to be Turing complete. - We use the XOR logic gate on an hexagonal grid. It corresponds to the rule 6. + [[File:ETH_Zurich_XOR_Logic_Gate.png|200px|center|thumb|'''Figure 3''' Truth table of an XOR logic gate.]]

## Pattern Formation

### Cellular Automata

Pattern formation was formalized by Neuman in the concept of cellular automata. Following a simple pre-programmed logic rule, the state of a cell is determined by the states of three parent cells (from the previous computation round). Those logic rules are discrete computations: they can be either implementing an AND logic gate or another rule. Wolfram  elaborated a whole theory on these cellular automata.

According to cellular automata theory, emergent patterns offer a large panel of properties: striking examples are the rule 30 which gives an apparently random pattern and the rule 110 which has been proven to be Turing complete. With cellular automata, you cannot predict how the final pattern will look like even if you know the rule that governs its property. Thus, the intricated computations of steps poses the problem of complexity.

We chose to implement the XOR gate with two inputs, corresponding to rule 6. It can be considered as a first step towards the rule 110, which is an XOR with 3 inputs and is known to be Turing complete.