Thomas Wöhlke - Systems- and Software-Engineering

Abstract The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers. In this system, each cell remains unchanged until some neighboring cell has a modular value exactly one unit larger than that of the cell itself, at which point it copies its neighbor's value. Run the Application git clone https://github.com/phasenraum2010/cyclic-cellular-automaton.git cd cyclic-cellular-automaton mvn clean install exec:java or Download the jar and double click on it to start the Application: http://www.thomas-woehlke.de/a/cyclic-cellular-automaton/cyclic-cellular-automaton-1.0-SNAPSHOT.jar Screenshots Early Screen Later More https://en.wikipedia.org/wiki/Cyclic_cellular_automaton https://github.com/phasenraum2010/cyclic-cellular-automaton  

Fractals and random walk due to Brownian motion cluster   Abstract Diffusion-limited aggregation (DLA) is the process whereby particles undergoing a random walk due to Brownian motion cluster together to form aggregates of such particles. This theory, proposed by T.A. Witten Jr. (not to be confused with Edward Witten) and L.M. Sander in 1981,[1] is applicable to aggregation in any system where diffusion is the primary means of transport in the system. DLA can be observed in many systems such as electrodeposition, Hele-Shaw flow, mineral deposits, and dielectric breakdown.   Run the Application git clone https://github.com/phasenraum2010/diffusion-limited-aggregation.git cd diffusion-limited-aggregation mvn clean install exec:java or Download the jar and double click on it to start the Application: http://www.thomas-woehlke.de/a/diffusion-limited-aggregation/diffusion-limited-aggregation-1.1-SNAPSHOT.jar   Screenshots Early Later More https://en.

Abstract Green food appears in a world with red moving cells. These cells eat the food if it is on their position. Movement of the cells depends on random and their DNA. A fit cell moves around and eats enough to reproduce. Reproduction is done by splitting the cell and randomly changing the DNA of the two new Cells. If a cell doesn't eat enough, it will first stand still and after a while it dies. Run the Application git clone https://github.com/phasenraum2010/simulated-evolution.git cd simulated-evolution mvn clean install exec:java or Download the jar and double click on it to start the Application: http://www.thomas-woehlke.de/a/simulated-evolution/simulated-evolution-1.1-SNAPSHOT.jar Screenshots Early Later Explanation     water     food     cell is young cell is fat enough to reproduce cell is old enough to reproduce cell is hungry and waiting for food or death cell is old and waiting for death * (if cell is fat and old enough for re

Abstract the Mandelbrot set is the set of values of c in the complex plane for which the orbit of 0 under iteration of the complex quadratic polynomial z_(n+1)=z_n^2+c remains bounded. That is, a complex number c is part of the Mandelbrot set if, when starting with z0 = 0 and applying the iteration repeatedly, the absolute value of zn remains bounded however large n gets.  Screenshots The Turing Machine runs around the Mandelbrot Set The Mandelbrot Set completed a click into the Mandelbrot Set draws the Julia Set a click into the Mandelbrot Set draws the Julia Set Running the Java Application git clone https://github.com/phasenraum2010/mandelbrot.git cd mandelbrot mvn clean install exec:java or Download the jar and double click on it to start the Application: http://www.thomas-woehlke.de/a/mandelbrot/mandelbrot-1.1-SNAPSHOT.jar Running the JavaScript Application goto: http://woehlke.org/html5-lab/mandelbrot/ The Turing Machine to Comp