| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331885 | Information Processing Letters | 2015 | 6 Pages |
Abstract
In particular, we demonstrate that an arithmetic ASRAM is more powerful than an arithmetic ARAM, that a sufficiently equipped ASRAM can recognise any language in the arithmetic hierarchy in constant time (and more, if it is given more time), and that, on the other hand, in some cases the ASRAM is no more powerful than its underlying RAM.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michael Brand,