Category:Models of computation
From Wikipedia, the free encyclopedia
The main article for this category is Model of computation .
The category of Computational Models lists abstract models for investigating computing machines. Standard computational models assume discrete time paradigm.
Wikimedia Commons has media related to Computational models .
Subcategories
This category has the following 19 subcategories, out of 19 total.
A
C
D
L
O
- Computation oracles (7 P)
P
- Petri nets (19 P)
- Process calculi (20 P)
Q
R
- Reversible computing (12 P)
S
T
- Transition systems (5 P)
- Turing machine (30 P)
Pages in category "Models of computation"
The following 128 pages are in this category, out of 128 total. This list may not reflect recent changes.
A
B
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
E
L
M
P
R
S
- James Sakoda
- Scott information system
- Sea of nodes
- SECD machine
- Shape Modeling International
- Stack machine
- State (computer science)
- State diagram
- State space (computer science)
- Stochastic cellular automaton
- Stochastic computing
- Stochastic Petri net
- Stream processing
- Stream X-Machine
- Structured program theorem
- SXM (computational model)