Abstract

In this paper, we prove that a k-tape Minsky machine operating with time \(T(n)\) can be modeled by a three-tape Minsky machine in a time not exceeding \(T{{(n)}^{k}} \times \log T(n)\). It is shown that multitape Turing machines can be modeled by three-tape Minsky machines with optimal word encoding.

中文翻译：

---

用三带式Minsky机器建模多带Minsky和Turing机器

摘要

在本文中，我们证明了一个ķ -tape明斯基机操作与时间\（T（n）的\）可以由三带明斯基机在一个时间不超过被建模\（T {{（N）} ^ { k}} \ times \ log T（n）\）。结果表明，多带图灵机可以通过具有最佳单词编码的三带明斯基机器进行建模。