A Note on Kolmogorov-Uspensky Machines
classification
💻 cs.CC
cs.FL
keywords
kolmogorov-uspenskymachinesreal-timeacceptedlanguagemachinenoteopen
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.