A Note on Kolmogorov-Uspensky Machines

TL;DR

This paper demonstrates that certain languages not recognizable in real-time by pointer machines can be accepted in real-time by Kolmogorov-Uspensky machines, addressing an open problem in computational theory.

Contribution

It proves that Kolmogorov-Uspensky machines can recognize some languages in real-time that pointer machines cannot, solving an open problem.

Findings

Kolmogorov-Uspensky machines accept certain non-real-time recognizable languages in real-time.

Addresses an open problem posed by Shvachko.

Shows a separation between pointer machines and Kolmogorov-Uspensky machines in real-time recognition.

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.