发表机构
Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology（麻省理工学院计算机科学与人工智能实验室）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究针对两类机器A和B，证明当A类机器满足特定资源条件时，不存在递归函数可界定A类替换为等价B类机器的描述大小增量。
AI 中文摘要
若某类A机器拥有足够资源，可满足：（i）解决B类机器无法解决的问题；（ii）模拟任何可访问线性有界计数器的一元双向确定型有限自动机，则通常不存在递归函数可对A类机器替换为等价B类机器时描述大小的增量给出上界。
英文摘要
If the machines of some type A have enough resources to (i) solve problems that no machine of type B can solve, and (ii) simulate any unary two-way deterministic finite automaton that has access to a linearly-bounded counter, then typically no recursive function can upper bound the increase in the size of description when a machine of type A is replaced by an equivalent machine of type B.
CommentsInternational Journal of Foundations of Computer Science, 16:943-956, 2005. Number of pages: 14. Number of figures: 0
