AI 中文总结
本文构造了一个120状态的二元图灵机，其停机行为等价于黎曼假设为假，相比744状态构造减少83.87%状态，创下新纪录。
AI 中文摘要
我们构造了一个显式的确定性单带、双符号图灵机，具有120个工作状态，其空白带计算停机当且仅当黎曼假设为假。该机器使用与广泛引用的744状态Matiyasevich-O'Rear-Aaronson构造相同的二元空白带模型和状态计数约定。从744个工作状态减少到120个，移除了624个状态，即83.87%。在独立的端到端验证的前提下，我们的机器是黎曼假设的新状态计数记录。
英文摘要
We construct an explicit deterministic one-tape, two-symbol Turing machine with 120 working states whose blank-tape computation halts if and only if the Riemann hypothesis is false. The machine uses the same binary blank-tape model and state-counting convention as the widely cited 744-state Matiyasevich-O'Rear-Aaronson construction. The reduction from 744 to 120 working states removes 624 states, or 83.87%. Subject to independent end-to-end verification, our machine is a new state-count record for the Riemann hypothesis.
