The input/output complexity, which is the complexity of data exchange between the main memory and the external memory, has been elaborately studied by a lot of former researchers. However, the existing works failed to consider the input/output complexity in a computation model point of view. In this paper we remedy this by proposing three variants of Turing machine that include external memory and the mechanism of exchanging data between main memory and external memory. Based on these new models, the input/output complexity is deeply studied. We discussed the relationship between input/output complexity and the other complexity measures such as time complexity and parameterized complexity, which is not considered by former researchers. We also define the external access trace complexity, which reflects the physical behavior of magnetic disks and gives a theoretical evidence of IO-efficient algorithms.
On the Turing Completeness of Transformers and Agents
SKLMS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);University of Chinese Academy of Sciences(中国科学院大学);Institute of AI for Industries, Chinese Academy of Sciences(中国科学院工业人工智能研究院)
Uncountable classical and quantum complexity classes
多项式时间常数空间量子图灵机(QTM)和对数空间概率图灵机(PTM)识别具有有限错误的无数语言(Say and Yakaryılmaz 2014,arXiv:1411.7647)。在本文中,我们调查更多的限制情况下,这两个模型识别不可数许多语言有界误差。我们表明,双对数空间是足够的一元语言的PTM扫描阅读模式或对数空间的单向头。在一元语言中,对于量子模型,我们得到了计数器机器的中对数空间。对于二进制语言,即使只使用计数器作为存储器,任意小的非常数空间也足以用于PTM。对于计数机,当限制在多项式时间时,我们可以得到同样的结果线性空间。对于恒定空间的QTM,我们遵循一个受限制的扫描头的结果,称为重新启动实时。