  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.
