加载中…
2012-11-23
A Note on Kolmogorov-Uspensky Machines
Holger Petersen
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本