Cellular automata and models of artificial life

MATH-527 / 5 credits

Teacher: Hudcová Barbora

Language: English

Summary

In this class, we will study artificial life, i.e. mathematical models that aim to capture key processes underlying life, in particular replication, emergence of complexity, and evolution.

Content

This is a topics class on the rapidly developing field of artificial life models. Key topics will include:

What is ALife: History and Overview
Cellular Automata Introduction
Von Neumann CA and Self-Replication
Turing Machines and the Recursion Theorem
Quines and Self-Replication
Simpler Self-Replicators and Open-Ended Evolution
Discovering CAs: Wolfram Classes and CA Complexity Metrics
CA Classification Schemes
CA Dynamical and Topological Properties
Cellular Automata and Computation
Randomized Models and Phase Transitions (Random Boolean Networks, Graph Cellular Automata)
Local and Global Simulation, Reversibility
Reaction-Diffusion, Turing Patterns
Lenia, Flow Lenia, Neural CAs

Assessment methods

Written

Resources

Moodle Link

In the programs

  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Cellular automata and models of artificial life
  • Courses: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Type: optional
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Cellular automata and models of artificial life
  • Courses: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Type: optional
  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Cellular automata and models of artificial life
  • Courses: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Type: optional

Reference week

Related courses

Results from graphsearch.epfl.ch.