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