fbpx
Wikipedia

Model of computation

January 01, 1970

For computer models simulating complex systems, see Computational model.

In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized.[1] 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 into three categories: sequential models, functional models, and concurrent models.

Sequential models edit

Sequential models include:

Functional models edit

Functional models include:

Concurrent models edit

Concurrent models include:

Some of these models have both deterministic and nondeterministic variants. Nondeterministic models are not useful for practical computation;[citation needed] they are used in the study of computational complexity of algorithms.

Models differ in their expressive power; for example, each function that can be computed by a Finite state machine can also be computed by a Turing machine, but not vice versa.

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.

See also edit

References edit

  1. ^ "Models of Computation" (PDF).

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.

January 01, 1970
model, computation, computer, models, simulating, complex, systems, computational, model, this, article, relies, largely, entirely, single, source, relevant, discussion, found, talk, page, please, help, improve, this, article, introducing, citations, additiona. For computer models simulating complex systems see Computational model This article relies largely or entirely on a single source Relevant discussion may be found on the talk page Please help improve this article by introducing citations to additional sources Find sources Model of computation news newspapers books scholar JSTOR February 2021 In computer science and more specifically in computability theory and computational complexity theory a model of computation is a model which describes how an output of a mathematical function is computed given an input A model describes how units of computations memories and communications are organized 1 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 Contents 1 Models 1 1 Sequential models 1 2 Functional models 1 3 Concurrent models 2 Uses 3 See also 4 References 5 Further readingModels editModels of computation can be classified into three categories sequential models functional models and concurrent models Sequential models edit Sequential models include Finite state machines Post machines Post Turing machines and tag machines Pushdown automata Register machines Random access machines Turing machines Decision tree model Functional models edit Functional models include Abstract rewriting systems Combinatory logic General recursive functions Lambda calculus Concurrent models edit Concurrent models include Actor model Cellular automaton Interaction nets Kahn process networks Logic gates and digital circuits Petri nets Synchronous Data Flow Some of these models have both deterministic and nondeterministic variants Nondeterministic models are not useful for practical computation citation needed they are used in the study of computational complexity of algorithms Models differ in their expressive power for example each function that can be computed by a Finite state machine can also be computed by a Turing machine but not vice versa Uses editIn 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 See also editStack machine 0 operand machine Accumulator machine 1 operand machine Register machine 2 3 operand machine Random access machine Abstract machine Cell probe model Robertson Webb query model Chomsky hierarchy Turing completenessReferences edit Models of Computation PDF Further reading editFernandez 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 Retrieved from https en wikipedia org w index php title Model of computation amp oldid 1168819455, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.