About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 158. Chapters: Turing machine, Finite-state machine, Lambda calculus, Quantum computer, Pushdown automaton, Oracle machine, Denotational semantics, One instruction set computer, Abstract machine, Algorithm characterizations, Algorithm examples, Register machine, UML state machine, Counter machine models, Stream processing, Petri net, Agent-based model, Counter machine reference model, X-machine, Decision field theory, P system, Tag system, Quantum circuit, NAR 2, Unbounded nondeterminism, Nondeterministic finite-state machine, State diagram, Stochastic computing, Stack machine, Decision tree model, Finite state transducer, Abstract state machines, Little man computer, Stream X-Machine, Cache-oblivious algorithm, NAR 1, Kahn process networks, Alternating Turing machine, Turmite, Bulk synchronous parallel, Topological computing, Moore machine, Topological quantum computer, Buchi automaton, Virtual finite state machine, Dataflow, Embedded pushdown automaton, Persistence, Description number, Deterministic pushdown automaton, Linear bounded automaton, Post canonical system, Event-driven finite state machine, CARDboard Illustrative Aid to Computation, Membrane computing, Billiard-ball computer, P, State transition system, Probabilistic Turing machine, Categorical abstract machine, Applicative computing systems, Scott information system, Mealy machine, Extended finite state machine, Parallel Random Access Machine, CIP-Tool, Zeno machine, Blum-Shub-Smale machine, Model of computation, LogP machine, State space, Interaction nets, Discrete system, Computational model, Nested stack automaton, Lazy linear hybrid automaton, Communicating X-Machine, Counter automaton, Trinomial tree, Finite state machine with datapath, Clumping. Excerpt: The word algorithm does not have a generally accepted definition. Researchers are actively working...
