We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Particle automaton
Jump to navigation
Jump to search
A particle automaton is a cellular automaton that exhibits conservation of state; that is, state can neither be created nor destroyed; the number of cells in a given state will remain the same throughout the life of the automaton.
Most esoteric programming languages which are based on particle automata are not true particle automata, in that they allow some of their state to sometimes be created or destroyed.
See also
- Category:Particle automata, a list of particle automata on the wiki
- Bully automaton