使用和不使用任意大数的计算
Computing with and without arbitrary large numbers
摘要:
在随机存取机(RAM)的研究中,已经表明,一个额外的输入整数的可用性,除了足够大之外没有特殊的属性,足以降低某些问题的计算复杂性。然而,到目前为止,这仅针对特定问题显示。我们提供了一个表征的权力,这种额外的投入一般问题。为此,我们首先修正了Simon和Szegedy(1992)以及Simon(1981)的一个经典结果。在前者,我们显示错误的证明和纠正这些由一个全新的建设,没有很大的变化的结果。在后者中,原来的证明方向只做了很小的修改,但新的结果比Simon(1981)的结果强得多。在这两种情况下,新的结构提供了所需的理论工具来表征任意大数的幂。
英文摘要:
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some problems. However, this has only been shown so far for specific problems. We provide a characterization of the power of such extra inputs for general problems. To do so, we first correct a classical result by Simon and Szegedy (1992) as well as one by Simon (1981). In the former we show mistakes in the proof and correct these by an entirely new construction, with no great change to the results. In the latter, the original proof direction stands with only minor modifications, but the new results are far stronger than those of Simon (1981). In both cases, the new constructions provide the theoretical tools required to characterize the power of arbitrary large numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。