Editing Computation (section)

== Mathematical models ==
{{Main|Model of computation}}
In the [[theory of computation]], a diversity of mathematical models of computation has been developed.
Typical mathematical [[Model of computation|models of computers]] are the following:
* State models including [[Turing machine]], [[pushdown automaton]], [[finite-state automaton]], and [[Parallel random access machine|PRAM]]
* Functional models including [[lambda calculus]]
* Logical models including [[logic programming]]
* Concurrent models including [[actor model]] and [[process calculi]]
Giunti calls the models studied by computation theory ''computational systems,'' and he argues that all of them are mathematical [[dynamical system]]s with discrete time and discrete state space.<ref>{{cite book|last=Giunti|first=Marco|title=Computation, Dynamics, and Cognition|place=New York|publisher=Oxford University Press|year=1997|isbn=978-0-19-509009-3}}</ref>{{rp|ch.1}} He maintains that a computational system is a complex object which consists of three parts. First, a mathematical dynamical system <math>DS</math> with discrete time and discrete state space; second, a computational setup <math>H=\left(F, B_F\right)</math>, which is made up of a theoretical part <math>F</math>, and a real part <math>B_F</math>; third, an interpretation <math>I_{DS,H}</math>, which links the dynamical system <math>DS</math> with the setup <math>H</math>.<ref>{{Citation|last=Giunti|first=Marco|year=2017|title=What is a Physical Realization of a Computational System?|journal=Isonomia -- Epistemologica|volume=9|pages=177–92|issn=2037-4348|url=https://www.researchgate.net/publication/319631506}}</ref>{{rp|pp.179–80}}