arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.4121cs.CC
收藏

不可预测性和计算不可约性

Unpredictability and Computational Irreducibility

Herve Zwirn, Jean-Paul Delahaye

摘要:

我们探讨了几个概念,用于分析直观的概念计算不可约性,我们提出了一个强大的正式定义,首先在该领域的细胞自动机,然后在一般领域的任何可计算的功能f从N到N。我们证明,通过一个强大的定义是什么意思“不能计算第n步,而不必遵循相同的路径比模拟自动机或功能”,这意味着真正的,直观地预期,如果一个对象的行为是计算不可约的,没有计算其第n个状态可以比模拟本身更快。

英文摘要:

We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f from N to N. We prove that, through a robust definition of what means "to be unable to compute the nth step without having to follow the same path than simulating the automaton or the function", this implies genuinely, as intuitively expected, that if the behavior of an object is computationally irreducible, no computation of its nth state can be faster than the simulation itself.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑