# Model of computation

In computer science, and more specifically in computability theory and computational complexity theory, a **model of computation** is a model which describes how a set of outputs are computed given a set of inputs. This model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.

## Models[edit]

Models of computation can be classified in three categories: sequential models, functional models, and concurrent models.

Sequential models include:

Functional models include:

Concurrent models include:

## Uses[edit]

In the field of runtime analysis of algorithms, it is common to specify a computational model in terms of *primitive operations* allowed which have unit cost, or simply **unit-cost operations**. A commonly used example is the random access machine, which has unit cost for read and write access to all of its memory cells. In this respect, it differs from the above-mentioned Turing machine model.

In *model-driven engineering*, the model of computation explains how the behaviour of the whole system is the result of the behaviour of each of its components.

A key point which is often overlooked is that published lower bounds for problems are often given for a model of computation that is more restricted than the set of operations that one could use in practice and therefore there may be algorithms that are faster than what would naïvely be thought possible.^{[1]}

## Categories[edit]

There are many models of computation, differing in the set of admissible operations and their computations cost. They fall into the following broad categories: abstract machine and models equivalent to it (e.g. lambda calculus is equivalent to the Turing machine), used in proofs of computability and upper bounds on computational complexity of algorithms, and decision tree models, used in proofs of lower bounds on computational complexity of algorithmic problems.

## See also[edit]

- Stack machine (0-operand machine)
- Accumulator machine (1-operand machine)
- Register machine (2,3,... operand machine)
- Random access machine
- Cell-probe model

## References[edit]

**^**Examples of the price of abstraction?, cstheory.stackexchange.com

## Further reading[edit]

- Fernández, Maribel (2009).
*Models of Computation: An Introduction to Computability Theory*. Undergraduate Topics in Computer Science. Springer. ISBN 978-1-84882-433-1. - Savage, John E. (1998).
*Models Of Computation: Exploring the Power of Computing*. Addison-Wesley. ISBN 978-0201895391.

This computer science article is a stub. You can help Wikipedia by expanding it. |