计算不可约性与计算类比
Computational Irreducibility and Computational Analogy
摘要:
在以前的论文中,我们提供了计算不可约性(CIR)概念的形式定义,即对于从N到N的函数f,如果不遵循与连续计算从i=1到n的所有值f(i)近似相同的路径,则不可能计算f(n)。我们的定义是基于E图灵机(枚举图灵机)的概念和E图灵机的逼近概念,并给出了它的形式定义。我们在这里精确这些定义,通过一些修改,旨在提高概念的鲁棒性。然后,我们引入了一个新的概念:计算类比,并证明了计算类比函数的一些性质。计算类比是一种等价关系,它允许将可计算函数的集合划分成类,这些类的成员具有关于它们的计算不可约性和它们的计算复杂性的相同属性。
英文摘要:
In a previous paper, we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than computing successively all the values f(i) from i=1 to n. Our definition is based on the concept of E Turing machines (for Enumerating Turing Machines) and on the concept of approximation of E Turing machines for which we also gave a formal definition. We precise here these definitions through some modifications intended to improve the robustness of the concept. We introduce then a new concept: the Computational Analogy and prove some properties of computationally analog functions. Computational Analogy is an equivalence relation which allows partitioning the set of computable functions in classes whose members have the same properties regarding to their computational irreducibility and their computational complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。