Grant: Discovery Grants Program - Individual
Trent University
$10,000.00
Emulation of dynamical systems within cellular automata
FY 2007-08
Summary
A cellular automaton is a deterministic dynamical system where elements are discrete lattices, each cell of the lattice takes a value from a finite alphabet, and a configuration evolves according to some local interaction rule. Thus cellular automata lend themselves to computational technologies. A subsystem of the cellular automaton is a set which is invariant under the action of the automaton. In this proposal we study what kinds of abstract dynamical systems can be emulated by a cellular automaton. For example given a self-similar system, can one find a cellular automaton, and a subsystem of that automaton which is "identical" to the self-similar system? The motivation behind this proposal is the notion that some cellular automata can be capable of "universal computation".
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
229162-2006
Name nom
Yassawi, Reem
Department département
Mathematics
Organization id
32
Institution établissement
Trent University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2006
Award amount
10000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2900
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Pure mathematics
Research subject fr
Mathématiques pures
Partie
2
Nb partie
5
Application title
Emulation of dynamical systems within cellular automata
Keyword
NA
Application summary
A cellular automaton is a deterministic dynamical system where elements are discrete lattices, each cell of the lattice takes a value from a finite alphabet, and a configuration evolves according to some local interaction rule. Thus cellular automata lend themselves to computational technologies. A subsystem of the cellular automaton is a set which is invariant under the action of the automaton. In this proposal we study what kinds of abstract dynamical systems can be emulated by a cellular automaton. For example given a self-similar system, can one find a cellular automaton, and a subsystem of that automaton which is "identical" to the self-similar system? The motivation behind this proposal is the notion that some cellular automata can be capable of "universal computation".