Abstract
Kolmogorov-Uspensky machines (KUM) and storage modification machines (SMM) are the variants of machines with graph storage, called here pointer machines (PM). It is an open problem whether SMMs are more powerful than KUMs. An approach to solution of this problem is suggested here. It is shown that with some restrictions weak variants of PMs, called tree pointer machines, and Turing machines with tree memory can not recognize in real time some language real time recognizible by SMMs.
Cite
CITATION STYLE
Shvachko, K. V. (1991). Different modifications of pointer machines and their computational power. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 520 LNCS, pp. 426–435). Springer Verlag. https://doi.org/10.1007/3-540-54345-7_86
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
