This article possibly contains original research. (May 2019) (Learn how and when to remove this template message) |

This article needs additional citations for verification. (May 2019) (Learn how and when to remove this template message) |

**Computation** is any type of calculation^{[1]}^{[2]} that includes both arithmetical and non-arithmetical steps and follows a well-defined model, for example an algorithm.

The study of computation is paramount (hypernymous) to the discipline of computer science.

A computation can be seen as a purely physical phenomenon occurring inside a closed physical system called a computer. Examples of such physical systems include digital computers, mechanical computers, quantum computers, DNA computers, molecular computers, microfluidics-based computers, analog computers, or wetware computers. This point of view has been adopted by the physics of computation, a branch of theoretical physics, as well as the field of natural computing.

An even more radical point of view, pancomputationalism, is the postulate of digital physics that argues that the evolution of the universe is itself a computation.

The classic account of computation is found throughout the works of Hilary Putnam and others. Peter Godfrey-Smith has dubbed this the "simple mapping account."^{[3]} Gualtiero Piccinini's summary of this account states that a physical system can be said to perform a specific computation when there is a mapping between the state of that system to the computation such that the “microphysical states [of the system] mirror the state transitions between the computational states.”^{[4]}

Philosophers such as Jerry Fodor^{[5]} have suggested various accounts of computation with the restriction that semantic content be a necessary condition for computation (that is, what differentiates an arbitrary physical system from a computing system is that the operands of the computation represent something). This notion attempts to prevent the logical abstraction of the mapping account of pancomputationalism, the idea that everything can be said to be computing everything.

Gualtiero Piccinini proposes an account of computation based in mechanical philosophy. It states that physical computing systems are types of mechanisms that, by design, perform physical computation, or “the manipulation (by a functional mechanism) of a medium-independent vehicle according to a rule.” Medium-independence requires that the property is able to be instantiated by multiple realizers and multiple mechanisms and that the inputs and outputs of the mechanism also be multiply realizable. In short, medium-independence allows for the use of physical variables with traits other than voltage (as in typical digital computers); this is imperative in considering other types of computation, such as that occurs in the brain or in a quantum computer. A rule, in this sense, provides a mapping among inputs, outputs, and internal states of the physical computing system. ^{[6]}

In the theory of computation, a diversity of mathematical models of computers has been developed. Typical mathematical models of computers are the following:

- State models including Turing machine, pushdown automaton, finite state automaton, and 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 systems with discrete time and discrete state space.^{[7]}^{:ch.1} He maintains that a computational system is a complex object which consists of three parts. First, a mathematical dynamical system with discrete time and discrete state space; second, a computational setup , which is made up of a theoretical part , and a real part ; third, an interpretation , which links the dynamical system with the setup .^{[8]}^{:pp.179–80}

- Computationalism
- Physical information
- Real computation
- Reversible computation
- Hypercomputation
- Lateral computing
- Computational problem
- Multiple realizability

**^**Computation from the Free Merriam-Webster Dictionary**^**"Computation: Definition and Synonyms from Answers.com".*Answers.com*. Archived from the original on 22 February 2009. Retrieved 26 April 2017.**^**Godfrey-Smith, P. (2009), "Triviality Arguments against Functionalism",*Philosophical Studies*,**145**(2): 273–95, doi:10.1007/s11098-008-9231-3**^**Piccinini, Gualtiero (2015).*Physical Computation: A Mechanistic Account*. Oxford: Oxford University Press. p. 18. ISBN 9780199658855.**^**Fodor, J. A. (1981), "The Mind-Body Problem",*Scientific American*,**244**(January 1981)**^**Piccinini, Gualtiero (2015).*Physical Computation: A Mechanistic Account*. Oxford: Oxford University Press. p. 10. ISBN 9780199658855.**^**Giunti, Marco (1997).*Computation, Dynamics, and Cognition*. New York: Oxford University Press. ISBN 978-0-19-509009-3.**^**Giunti, Marco (2017), "What is a Physical Realization of a Computational System?",*Isonomia -- Epistemologica*,**9**: 177–92, ISSN 2037-4348