Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Methods and Applications of Algorithmic ComplexityPreliminaries

Methods and Applications of Algorithmic Complexity: Preliminaries [An abstract computer program (or machine) can be defined in terms of input, output, and a set of allowable operations used to turn the input into the output. Examples of popular models of computation are Turing machinesTuring machinemodel of computation (sometimes denoted by TM), cellular automataCellular automata (denoted by CA) and Post Tag systemsPost tag systems, to mention but three examples of models of computation (there is a very long list).] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Methods and Applications of Algorithmic ComplexityPreliminaries

Download PDF
12 pages

Loading next page...
 
/lp/springer-journals/methods-and-applications-of-algorithmic-complexity-preliminaries-RZ0c4d9A6Q
Publisher
Springer Berlin Heidelberg
Copyright
© Springer-Verlag GmbH Germany, part of Springer Nature 2022
ISBN
978-3-662-64983-1
Pages
3 –15
DOI
10.1007/978-3-662-64985-5_1
Publisher site
See Chapter on Publisher Site

Abstract

[An abstract computer program (or machine) can be defined in terms of input, output, and a set of allowable operations used to turn the input into the output. Examples of popular models of computation are Turing machinesTuring machinemodel of computation (sometimes denoted by TM), cellular automataCellular automata (denoted by CA) and Post Tag systemsPost tag systems, to mention but three examples of models of computation (there is a very long list).]

Published: May 17, 2022

There are no references for this article.