model of computation
C7185
concept
A model of computation is an abstract mathematical framework that defines how algorithms are represented and executed, specifying the rules, operations, and resources available for performing computations.
All labels observed (27)
| Label | Occurrences |
|---|---|
| process calculus | 7 |
| computational model | 6 |
| programming model | 5 |
| parallel programming model | 4 |
| model of computation canonical | 2 |
| Computing paradigm | 1 |
| algebra of communicating processes | 1 |
| background process model | 1 |
| complexity theory framework | 1 |
| computational neuroscience model | 1 |
| concept in computability theory | 1 |
| finite state machine formalism | 1 |
| finite-state machine formalism | 1 |
| formal framework in computational complexity theory | 1 |
| formal model of computation | 1 |
| law of computing | 1 |
| mathematical model of concurrency | 1 |
| model of concurrency | 1 |
| molecular computing | 1 |
| operational semantics | 1 |
| operational semantics formalism | 1 |
| parallel computing model | 1 |
| process algebra | 1 |
| shared-memory programming model | 1 |
| unconventional computing | 1 |
| unified programming model | 1 |
| virtual memory model | 1 |
Instances (36)
| Instance | Via concept surface |
|---|---|
| Blum complexity measures | formal framework in computational complexity theory |
| working set model | virtual memory model |
| Windows services | background process model |
| MapReduce | programming model |
| Google MapReduce | programming model |
| Compute Unified Device Architecture | programming model |
| Augmented Transition Network | computational model |
| π-calculus | process calculus |
|
CCS (Calculus of Communicating Systems)
surface form:
CCS
|
process calculus |
| Koomey's law | law of computing |
| lambda calculus | — |
| Open Multi-Processing | parallel programming model |
| Open Accelerators | parallel programming model |
| Hodgkin–Huxley model | computational neuroscience model |
|
ATN
surface form:
Augmented Transition Network
|
computational model |
| NVIDIA CUDA | programming model |
| Apache Beam | unified programming model |
| Kleene numbering | concept in computability theory |
| Blum–Shub–Smale model of computation | computational model |
| Landin’s SECD machine | operational semantics formalism |
| combinatory logic | — |
| OpenMP | parallel programming model |
| NFA | computational model |
| SYCL | parallel programming model |
| Cloud computing | Computing paradigm |
| DNA computing | unconventional computing |
| transition network | computational model |
|
mobile ambients
surface form:
Mobile Ambients
|
process calculus |
| spi-calculus | process calculus |
| join-calculus | process calculus |
| LOTOS | process algebra |
|
CCS
surface form:
Calculus of Communicating Systems
|
process calculus |
| structural operational semantics | operational semantics |
| Sun RPC | programming model |
| hybrid automata | computational model |
| CSP (Communicating Sequential Processes) | process calculus |