行为仿真的渐近内在普适性和可重编程性
Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation
摘要:
我们提出了一个贝叶斯的概念“内在的渐近普遍性”采取其最终结论以前的概念和数值工作的基础上的概念的可重编程性测试和调查的复杂定性行为的计算机程序。我们的方法可以量化自然和经典系统的计算能力的信任和信心,并量化计算机的可重编程程度。我们测试的方法,以提供证据,有利于一个猜想的计算能力的忙碌的海狸图灵机的候选人图灵的普遍性。该方法最近已被用来量化的“本质上普遍的”细胞自动机的数量,结果指向由于广泛的仿真能力的普遍性。我们的方法代表了一种非传统的方法,以经典和开创性的概念图灵的普遍性,它可以扩展和应用在更广泛的背景下,自然计算,通过(在类似图灵测试的精神)观察系统的行为的情况下,正式证明的普遍性是困难的,如果不是不可能的。
英文摘要:
We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammability test and an investigation of the complex qualitative behaviour of computer programs. Our method may quantify the trust and confidence of the computing capabilities of natural and classical systems, and quantify computers by their degree of reprogrammability. We test the method to provide evidence in favour of a conjecture concerning the computing capabilities of Busy Beaver Turing machines as candidates for Turing universality. The method has recently been used to quantify the number of 'intrinsically universal' cellular automata, with results that point towards the pervasiveness of universality due to a widespread capacity for emulation. Our method represents an unconventional approach to the classical and seminal concept of Turing universality, and it may be extended and applied in a broader context to natural computation, by (in something like the spirit of the Turing test) observing the behaviour of a system under circumstances where formal proofs of universality are difficult, if not impossible to come by.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。