Category:Models of computation
![]() | Computing portal |
Here is a list of articles in the Models of computation category of the Computing portal that unifies foundations of mathematics and computations using computers.
The category of Computational Models lists abstract models for investigating computing machines. Standard computational models assume discrete time paradigm.
Subcategories
This category has the following 6 subcategories, out of 6 total.
A
C
L
P
Q
Pages in category "Models of computation"
The following 123 pages are in this category, out of 123 total.
- Model of computation (computing)
A
- Abstract machine (computing)
- Abstract state machine (computing)
- Abstract state machines (computing)
- Agent-based model (computing)
- Algorithm characterizations (computing)
- Alternating Turing machine (computing)
- Applicative computing systems (computing)
- Augmented marked graph (computing)
B
- Behavior tree (artificial intelligence, robotics and control) (computing)
- Belt machine (computing)
- Billiard-ball computer (computing)
- Binomial options pricing model (computing)
- Blum–Shub–Smale machine (computing)
- Bulk synchronous parallel (computing)
C
- Cache-oblivious algorithm (computing)
- Cache-oblivious distribution sort (computing)
- CARDboard Illustrative Aid to Computation (computing)
- Categorical abstract machine (computing)
- Cell-probe model (computing)
- Channel system (computer science) (computing)
- Chaos computing (computing)
- CIP-Tool (computing)
- Communicating finite-state machine (computing)
- Communicating X-Machine (computing)
- Complexity and Real Computation (computing)
- Computational model (computing)
- Computing with Memory (computing)
- Counter automaton (computing)
- Counter-machine model (computing)
D
- Dataflow (computing)
- Decision field theory (computing)
- Decision tree model (computing)
- Denotational semantics (computing)
- Description number (computing)
- Deterministic pushdown automaton (computing)
- Discrete system (computing)
- DNA computing (biology)
E
- Effective Fragment Potential Method (computing)
- Effective fragment potential method (computing)
- Embedded pushdown automaton (computing)
- Event-driven finite-state machine (computing)
- Evolution in Variable Environment (computing)
- Extended finite-state machine (computing)
- External memory algorithm (computing)
F
- Finite state machine with datapath (computing)
- Finite-state machine with datapath (computing)
- FRACTRAN (computing)
- Funnelsort (computing)
H
- HYSPLIT (computing)
I
- Interaction nets (computing)
K
- Kahn process networks (computing)
- Korn–Kreer–Lenssen model (computing)
- Krivine machine (computing)
L
- Lambda calculus (computing)
- Lazy linear hybrid automaton (computing)
- Linear bounded automaton (computing)
- LogP machine (computing)
M
- Markov algorithm (computing)
- MATSim (computing)
- Membrane computing (computing)
- Multi-tape Turing machine (computing)
N
- NAR 1 (computing)
- NAR 2 (computing)
- Nested stack automaton (computing)
- Nets within Nets (computing)
O
- Oblivious RAM (computing)
- Oblivious ram (computing)
- One instruction set computer (computing)
- One-instruction set computer (computing)
- Oracle machine (computing)
P
- P′′ (computing)
- P system (computing)
- Parallel external memory (computing)
- Parallel random-access machine (computing)
- Parasitic computing (computing)
- Peptide computing (biology)
- Persistence (computer science) (computing)
- Petri net (computing)
- Post canonical system (computing)
- Post–Turing machine (computing)
- Probabilistic Turing machine (computing)
- Pushdown automaton (computing)
Q
- Quantum capacity (computing)
- Quantum circuit (computing)
- Quantum computing (engineering)
- Queue automaton (computing)
R
- Realization (systems) (computing)
- Register machine (computing)
- Reo Coordination Language (computing)
- Reversible computing (computing)
S
- Scott information system (computing)
- SECD machine (computing)
- Shape Modeling International (computing)
- Stack machine (computing)
- State (computer science) (computing)
- State diagram (computing)
- State space (computing)
- Stochastic computing (computing)
- Stochastic Petri net (computing)
- Stream processing (computing)
- Stream X-Machine (computing)
- Structured program theorem (computing)
- SXM (computational model) (computing)
T
- Tag system (computing)
- Thread automaton (computing)
- Time loop logic (computing)
- Topological quantum computer (physics)
- Transdichotomous model (computing)
- Transition system (computing)
- Tree stack automaton (computing)
- Trinomial tree (computing)
- Turing machine (computing)
- Turing machine equivalents (computing)
- Turmite (computing)
U
- UML state machine (computing)
- Unbounded nondeterminism (computing)
- Unidirectional Data Flow (computer science) (computing)
V
- Vector addition system (computing)
- Virtual finite-state machine (computing)
W
- Word RAM (computing)
X
- X-machine (computing)
Z
- Zeno machine (computing)