Category:Computational models

From Biocrawler, the free encyclopedia.

The category of Computational Models lists abstract models for investigating computing machines. Standard computational models assume discrete time paradigm.bg:Категория:Изчислителни модели cs:Kategorie:Výpočetní modely

Subcategories

There is 1 subcategory to this category.

A

• Automata

Articles in category "Computational models"

There are 35 articles in this category.

A Abstract state machine Agent based model Alternating Turing machine Alternating finite automaton C Cache-oblivious model Cardiac - cardboard illustrative aid to computation D Deterministic finite state machine F Finite state machine Finite state transducer G Generalized nondeterministic finite state machine L Linear bounded automaton

M Machines that always halt Mealy machine Moore machine N Non-deterministic Turing machine Nondeterministic finite state machine O Oracle machine P P system Parallel Random Access Machine Post machine Probabilistic Turing machine Pushdown automaton Q Quantum circuit

R Rabin automaton Random Access Machine Register machine S Stack machine State diagram State transition system String rewriting T Tag systems Time loop logic Tree automaton Turing machine Z Zeno machine

Wikipedia (http://en.wikipedia.org/wiki/Main_Page) Category:Computational_models (http://en.wikipedia.org/wiki/Category:Computational_models) version history (http://en.wikipedia.org/w/index.php?title=Category:Computational_models&action=history) GNU Free Documentation Lizenz (http://en.wikipedia.org/wiki/Wikipedia:Text_of_the_GNU_Free_Documentation_License) CC-by-sa (http://creativecommons.org/licenses/by-sa/2.5/)

---