Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.entcs.2005.09.017 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
turing-complete state-transition model,eectiveness,turing-complete state-transition models,turing machines,abstract effective models,operating over any countable domain. key words: computational models,abstract state machines,resultant class,effective models,abstract machine,computational model,asm,effectiveness,countable domain,computational models,effectiveness requirement,turing machine,computer model,state transition,abstract state machine | Countable set,Universal Turing machine,Computer science,Abstract state machines,Super-recursive algorithm,Theoretical computer science,Finite-state machine,Turing machine,Register machine,Abstract machine | Journal |
Volume | Issue | ISSN |
135 | 3 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
4 | 0.46 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Udi Boker | 1 | 141 | 16.24 |
| Nachum Dershowitz | 2 | 2818 | 473.00 |