KI-Glossar
Das vollständige Wörterbuch der Künstlichen Intelligenz
Game of Life
Two-dimensional cellular automaton designed by John Conway in 1970, where each cell survives, dies, or is born according to the number of living neighbors, demonstrating how simple rules can generate complex behaviors.
Transition Rule
Deterministic function that defines the future state of a cell based on its current state and those of its neighbors, constituting the algorithmic core of any cellular automaton.
Moore Neighborhood
Neighborhood configuration comprising the eight cells adjacent to a central cell in a square grid, widely used in two-dimensional cellular automata for local interactions.
von Neumann Neighborhood
Neighborhood structure limited to the four orthogonal adjacent cells (north, south, east, west) to a central cell, reducing computational complexity while maintaining significant emergent properties.
Cellular State
Discrete value assigned to each cell in a cellular automaton, which can be binary (alive/dead) or multiple, determining its behavior in successive iterations of the system.
Initial Configuration
Initial spatial distribution of cellular states that serves as the starting point for the temporal evolution of the automaton, crucially influencing the observed emergent patterns.
One-dimensional Cellular Automaton
Variant of cellular automaton where cells are arranged on a line and evolve according to the states of their immediate neighbors, allowing systematic study of the space of possible transition rules.
Totalistic Cellular Automaton
Type of automaton where the future state of a cell depends only on the number of neighbors in each state rather than their specific position, simplifying analysis while maintaining behavioral richness.
Rule 30
A one-dimensional cellular automaton rule famous for generating complex and pseudo-random patterns from simple initial conditions, discovered by Stephen Wolfram in his systematic study of automata.
Rule 110
A one-dimensional cellular automaton rule proven to be Turing-complete, therefore capable of executing any algorithmic computation, establishing a fundamental link between cellular automata and computability theory.
Periodic Boundary
Boundary condition where opposite edges of the cellular grid are connected, creating a toroidal topology that eliminates edge effects and simulates an infinite space.
Kolmogorov Complexity
Algorithmic measure of the complexity of a cellular pattern, defined as the length of the shortest program capable of generating this pattern, thereby quantifying its intrinsic informational content.
Discrete Dynamical System
Theoretical framework to which cellular automata belong, characterized by discrete-time evolutions and finite state spaces, allowing rigorous mathematical analysis of their behavior.
Attractor
Set of configurations to which a cellular automaton converges after a sufficient number of iterations, representing the stable or cyclic states of the underlying dynamical system.
Cellular Automaton Machine
Specialized computer architecture designed for efficient parallel execution of cellular automata, optimizing local communications between computing units to simulate large-scale complex systems.
Cellular Language
Theoretical formalism extending cellular automata to model linguistic and cognitive phenomena, using transition rules to simulate the evolution of complex informational structures.