Information About ^{^™}

Computational Models Category


Abstract State Machines	Acyclic Deterministic Finite Automaton	Agent Based Model
Algorithm Characterizations	Algorithm Examples	Alternating Turing Machine
Billiard-ball Computer	Bulk Synchronous Parallel	Cache-oblivious Algorithm
Cardboard Illustrative Aid To Computation	Counter Machine	Counter Machine Models
Counter Machine Reference Model	Dataflow	Decision Field Theory
Denotational Semantics	Deterministic Finite-state Machine	Deterministic Pushdown Automaton
Event-driven Finite State Machine	Exspect	Extended Finite State Machine
Finite State Machine	Finite State Transducer	Interaction Nets
Kahn Process Networks	Lambda Calculus	Lazy Linear Hybrid Automaton
Linear Bounded Automaton	Machine That Always Halts	Marked Graph
Mealy Machine	Moore Machine	Nar 1
Nar 2	Nested Stack Automaton	Nondeterministic Finite State Machine
Non-deterministic Turing Machine	One Instruction Set Computer	Oracle Machine
Parallel Random Access Machine	Persistence Computer Science	Petri Net
Pointer Machine	Post-turing Machine	Probabilistic Turing Machine
P System	Pushdown Automaton	Quantum Circuit
Quantum Computer	Random Access Machine	Random Access Stored Program Machine
Register Machine	Scott Information System	Stack Machine
State Computer Science	State Diagram	State Space
State Transition System	String Rewriting	Tag System
Time Loop Logic	Turing Machine	Turing Machine Equivalents
Turing Machine Examples	Turing Machine Gallery	Turing Switch
Unbounded Nondeterminism	Universal Turing Machine	Virtual Finite State Machine
Wang B-machine	Well-formed Petri Net	Zeno Machine

	CATEGORIES ABOUT COMPUTATIONAL MODELS



	programming language topics

	specific models

	theory of computation