100年后,我们最终能破解Post的标签问题吗?计算不可约化的故事,以及更多
After 100 Years, Can We Finally Crack Post's Problem of Tag? A Story of Computational Irreducibility, and More
摘要:
从经验,理论和历史方面的邮政的“标签问题”从1921年进行了探讨。强计算不可约性的证据被发现。尽管其确定性的起源,连续序列的长度产生的似乎密切接近随机游动。所有10^25个最小的初始条件最终都被发现停止,尽管有时在> 6*10^11步中。计算等价性的原则的影响进行了讨论,以及可识别的标签系统的计算能力的例子。各种最小的复杂行为的例子被发现,包括3n+1 Collatz问题的偏差较小的模拟。也有讨论的历史埃米尔邮政和标签系统的背景下,思想的基础数学和计算。
英文摘要:
Empirical, theoretical and historical aspects of Post's "problem of tag" from 1921 are explored. Evidence of strong computational irreducibility is found. Despite their deterministic origin, the lengths of successive sequences generated seem to closely approximate random walks. All 10^25 smallest initial conditions are found to eventually halt, although sometimes in > 6*10^11 steps. Implications of the Principle of Computational Equivalence are discussed, along with examples of identifiable computational capabilities of tag systems. Various minimal examples of complex behavior are found, including a less-biased analog of the 3n+1 Collatz problem. There is also discussion of the history of Emil Post and of tag systems in the context of ideas about the foundations of mathematics and computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。