%0 Journal Article
%T A Note on Kolmogorov-Uspensky Machines
%A Holger Petersen
%J Computer Science
%D 2012
%I arXiv
%X 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.
%U http://arxiv.org/abs/1211.5544v1