A Note on Kolmogorov-Uspensky Machines
Computational Complexity
2012-11-26 v1 Formal Languages and Automata Theory
Abstract
Solving an open problem stated by Shvachko, it is shown that a language which is not real-time recognizable by some variants of pointer machines can be accepted by a Kolmogorov-Uspensky machine in real-time.
Cite
@article{arxiv.1211.5544,
title = {A Note on Kolmogorov-Uspensky Machines},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1211.5544},
year = {2012}
}