Model of computation
In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.
- Comment
- enIn computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.
- Has abstract
- enIn computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.
- Hypernym
- Definition
- Is primary topic of
- Model of computation
- Label
- enModel of computation
- Link from a Wikipage to another Wikipage
- Abstract machine
- Abstract rewriting system
- Accumulator machine
- Actor model
- Algorithm
- Analysis of algorithms
- Category:Computability theory
- Category:Computational complexity theory
- Category:Models of computation
- Cell-probe model
- Cellular automaton
- Chomsky hierarchy
- Circuit (computer science)
- Combinatory logic
- Computability theory (computer science)
- Computational complexity
- Computational complexity theory
- Computer science
- Decision tree model
- Deterministic model
- Finite state machine
- Function (mathematics)
- General recursive function
- Implementation
- Interaction nets
- Kahn process networks
- Lambda calculus
- Logic gate
- Nondeterministic model of computation
- Petri nets
- Post–Turing machine
- Pushdown automata
- Random-access machine
- Register machine
- Robertson–Webb query model
- Stack machine
- Synchronous Data Flow
- Tag system
- Turing completeness
- Turing machine
- SameAs
- 2V5LV
- Laskennan malli
- m.025rzzp
- Modelo de computação
- Modelo de computación
- Model of computation
- Model računanja
- Mô hình tính toán
- Q2651576
- Výpočetní model (teorie algoritmů)
- Μοντέλο υπολογισμού
- Изчислителен модел
- Модель вычислений
- Модель обчислення
- מודל חישובי
- مدل محاسبه
- نموذج حوسبة
- 計算モデル
- 计算模型 (数学)
- Subject
- Category:Computability theory
- Category:Computational complexity theory
- Category:Models of computation
- WasDerivedFrom
- Model of computation?oldid=1094361730&ns=0
- WikiPageLength
- 3716
- Wikipage page ID
- 1773278
- Wikipage revision ID
- 1094361730
- WikiPageUsesTemplate
- Template:Cite book
- Template:Cn
- Template:Computer science
- Template:For
- Template:One source
- Template:Reflist
- Template:Short description