Category:Models of computation

A

• Abstract machines (1 C, 7 P)
• Actor model (computer science) (14 P)
• Applicative computing systems (5 P)
• Automata (computation) (3 C, 82 P)

C

• Combinatory logic (1 C, 9 P)

D

• Denotational semantics (1 C, 7 P)
• Distributed stream processing (6 P)

L

• Lambda calculus (3 C, 48 P)

O

• Computation oracles (7 P)

P

• Persistence (2 C, 14 P)
• Petri nets (20 P)
• Process calculi (20 P)
• Programming paradigms (14 C, 107 P)

Q

• Quantum computing (3 C, 88 P)

R

• Register machines (1 C, 6 P)
• Reversible computing (10 P)

S

• Stack machines (1 C, 10 P)

T

• Transition systems (5 P)
• Turing machine (30 P)

• Model of computation

A

• Abstract machine
• Abstract state machine
• Agent-based model
• Algorithm characterizations
• Alternating Turing machine
• Applicative computing systems
• Augmented marked graph

B

• Behavior tree (artificial intelligence, robotics and control)
• Billiard-ball computer
• Binomial options pricing model
• Biological computing
• Blum–Shub–Smale machine
• Bulk synchronous parallel

C

• Cache-oblivious algorithm
• Cache-oblivious distribution sort
• CARDboard Illustrative Aid to Computation
• Categorical abstract machine
• Cell-probe model
• Channel system (computer science)
• Chaos computing
• CIP-Tool
• Communicating finite-state machine
• Communicating X-Machine
• Complexity and Real Computation
• Computational model
• Computing with Memory
• Counter-machine model

D

• Data-driven model
• Dataflow
• Decision field theory
• Decision tree model
• Denotational semantics
• Description number
• Deterministic pushdown automaton
• Discrete system
• DNA computing

E

• Effective fragment potential method
• Embedded pushdown automaton
• Event-driven finite-state machine
• Extended finite-state machine
• External memory algorithm

F

• FRACTRAN
• Funnelsort

G

• Glossary of quantum computing

I

• Interaction nets

K

• Kahn process networks
• Korn–Kreer–Lenssen model
• Krivine machine

L

• Lambda calculus
• Lattice model (finance)
• Lazy linear hybrid automaton
• Linear bounded automaton
• LogP machine

M

• Markov algorithm
• Massively parallel communication
• MATSim
• Mealy machine
• Membrane computing
• Quantum volume
• Multi-tape Turing machine

N

• NAR 1
• NAR 2
• Nested stack automaton
• Nets within Nets

O

• Oblivious RAM
• One-instruction set computer
• One-way quantum computer
• Optical computing

P

• P′′
• P system
• Parallel external memory
• Parallel RAM
• Parasitic computing
• Peptide computing
• Persistence (computer science)
• Petri net
• Post canonical system
• Post–Turing machine
• Probabilistic Turing machine
• Pushdown automaton

Q

• Quantum capacity
• Quantum circuit
• Quantum computing
• Quantum random circuits
• Queue automaton

R

• Real computation
• Realization (systems)
• Register machine
• Reo Coordination Language
• Reversible computing
• Robertson–Webb query model

S

• Scott information system
• Sea of nodes
• SECD machine
• Shape Modeling International
• Stack machine
• State (computer science)
• State diagram
• State space (computer science)
• Stochastic computing
• Stochastic Petri net
• Stream processing
• Stream X-Machine
• Structured program theorem
• SXM (computational model)

T

• Tag system
• Thread automaton
• Time loop logic
• Topological quantum computer
• Transdichotomous model
• Transition system
• Tree stack automaton
• Trinomial tree
• Turing machine
• Turing machine equivalents
• Turmite

U

• UML state machine
• Unbounded nondeterminism
• Unidirectional data flow

V

• Vector addition system
• Virtual finite-state machine

W

• WDR paper computer
• Word RAM

X

• X-machine

Z

• Zeno machine