Menu |
Category F.1.1 Models of ComputationAutomata (e.g., finite, push-down, resource-bounded)
Bounded-action devices (e.g., Turing machines, random access machines)
Computability theory
Relations between models
Self-modifying machines (e.g., neural networks)
Unbounded-action devic Browse in:All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles Hide subcategories objects Current category:
Top
::
ITHEA Classification Structure
::
F. Theory of Computation
::
F.1 COMPUTATION BY ABSTRACT DEVICES
::
F.1.1 Models of Computation
|
Login World Clock |