A 120-State Binary Turing Machine Equivalent to the Riemann Hypothesis

Joseph M. Shunia

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…