Selected Topics in Cellular Automata
Cellular automata are discrete, abstract computational systems that are used as models of complexity and computation as well as for representing dynamical systems. Simple rules often give rise to complex behaviour that is hard to understand.
The following are a few possible thesis topics within this field:
- Equivalencies between variants of one-dimensional cellular automata
- Emergent properties of simple two-dimensional Turing machines
A certain level of mathematical maturity is recommended.
If you are interested, reach out to Roger Antonsen (firstname.lastname@example.org).