Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424131 | Electronic Notes in Theoretical Computer Science | 2006 | 9 Pages |
Abstract
We modify Gurevich's notion of abstract machine so as to encompass computational models, that is, sets of machines that share the same domain. We also add an effectiveness requirement. The resultant class of “Effective Models” includes all known Turing-complete state-transition models, operating over any countable domain.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics