Model of Computation

A Model of Computation is a set of operations used in computation and their respective costs.

• Example(s):
  • abstract machines and models equivalent to it (e.g. lambda calculus is equivalent to the Turing machine) that can be used in proofs of computability and [[upper bounds on computational complexity of algorithms]].
  • decision tree models, used in [[proofs of lower bounds on computational complexity of algorithmic problem]]s.
• See: Computability Theory (Computer Science), Computational Complexity Theory, Algorithm, Run Time (Program Lifecycle Phase), Memory Space, Turing Machines, Finite State Machine, μ-Recursive Function, Lambda Calculus, Combinatory Logic, Abstract Rewriting System, Analysis of Algorithms, Random Access Machine.

---

---

References

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/model_of_computation Retrieved:2017-5-18.
  • In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in computation and their respective costs. It is used for measuring the complexity of an algorithm in execution time and or memory space: by assuming a certain model of computation, it is possible to analyze the computational resources required or to discuss the limitations of algorithms or computers.

2014

• (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/model_of_computation Retrieved:2014-9-17.
  • In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in computation and their respective costs. It is used for measuring the complexity of an algorithm in execution time and or memory space: by assuming a certain model of computation, it is possible to analyze the computational resources required or to discuss the limitations of algorithms or computers.

    Some examples of models include Turing machines, finite state machines, recursive functions, lambda calculus, combinatory logic, and abstract rewriting systems.

    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.

    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.

    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 naively be thought possible.

---