Model Of Computation

In the Theory Of Computation , abstract machines are often used in Thought Experiments regarding computability or to analyze the complexity of algorithms (''see'' Computational Complexity Theory ). A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter. The best-known example is the Turing Machine .

More complex definitions create abstract machines with full Instruction Set s, Register s and models of Memory . One popular model more similar to real modern machines is the RAM Model , which allows random access to indexed memory locations. As the performance difference between different levels of cache memory grows, cache-sensitive models such as the External-memory Model and Cache-oblivious Model are growing in importance.

An abstract machine can also refer to a Microprocessor design which has yet to be (or is not intended to be) implemented as hardware. An abstract machine implemented as a software simulation, or for which an Interpreter exists, is called a Virtual Machine .

Through the use of abstract machines it is possible to compute the amount of resources (time, memory, etc.) necessary to perform a particular operation without having to construct an actual system to do it.

LIST OF ABSTRACT MACHINES

Information About

Model Of Computation