关于代数数的计算复杂性--再论Hartmanis-Stearns问题
On the computational complexity of algebraic numbers: the Hartmanis--Stearns problem revisited
摘要：
从计算的角度考虑了代数无理数的整数基展开式的复杂性。我们表明，Hartmanis-Stearns问题可以解决一个令人满意的方式为类的多栈机。在这个方向上，我们的主要结果是，基地$b$扩展的代数无理实数不能产生的确定性下推自动机。我们还证实了一个旧的索赔科巴姆证明，这样的数字不能产生的标记机的膨胀因子大于1。
英文摘要：
We consider the complexity of integer base expansions of algebraic irrational numbers from a computational point of view. We show that the Hartmanis--Stearns problem can be solved in a satisfactory way for the class of multistack machines. In this direction, our main result is that the base-$b$ expansion of an algebraic irrational real number cannot be generated by a deterministic pushdown automaton. We also confirm an old claim of Cobham proving that such numbers cannot be generated by a tag machine with dilation factor larger than one.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
