Collatz程序收敛阶梯的规范与验证
Specifying and Verifying the Convergence Stairs of the Collatz Program
AI总结：
本文提出将Collatz猜想表述为并发程序的新方法，给出任意正整数j对应的第j级收敛阶梯的通用规范，实现生成工具并验证阶梯内数值满足猜想，指出证明猜想需证所有阶梯并集为自然数集这一开放问题。
摘要：
本文提出了一种算法方法，给定正整数$j$，该方法可生成第$j$级收敛阶梯，其中包含所有恰好经过$j$次Collatz函数应用后满足Collatz猜想的自然数。为此，我们将Collatz猜想新颖地表述为一个并发程序，并给出了任意$j>0$时第$j$级收敛阶梯的通用情形规范。所提出的规范为组织在无限个无限二叉树中的Collatz数提供了分层且线性化的导向。据我们所知，这是首次提出此类通用规范，其在分析和测试复杂非线性系统的行为方面具有重要应用价值。我们已将该方法实现为一个软件工具，可生成各个阶梯的Collatz数。我们还证明，从任意收敛阶梯中的任意值出发，该猜想均成立。然而，要证明该猜想，必须证明每个自然数都会出现在某个阶梯中；也就是说，所有阶梯的并集等于自然数集，这仍是一个未解决的问题。
英文摘要：
This paper presents an algorithmic method that, given a positive integer $j$, generates the $j$-th convergence stair containing all natural numbers from where the Collatz conjecture holds by exactly $j$ applications of the Collatz function. To this end, we present a novel formulation of the Collatz conjecture as a concurrent program, and provide the general case specification of the $j$-th convergence stair for any $j > 0$. The proposed specifications provide a layered and linearized orientation of Collatz numbers organized in an infinite set of infinite binary trees. To the best of our knowledge, this is the first time that such a general specification is provided, which can have significant applications in analyzing and testing the behaviors of complex non-linear systems. We have implemented this method as a software tool that generates the Collatz numbers of individual stairs. We also show that starting from any value in any convergence stair the conjecture holds. However, to prove the conjecture, one has to show that every natural number will appear in some stair; i.e., the union of all stairs is equal to the set of natural numbers, which remains an open problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
