Computing the Random 3-SAT Threshold
There is a real number such that for and for , and there is one finite deterministic Turing machine which, on input for any integer , halts with a rational number satisfying , using no oracle, advice, or noncomputable real constant.
All hypotheses of Lemma 2.1 are rigorously established by Theorem 4.4, Proposition 4.5, Lemma 5.1, and Lemma 9.1, so the existence and computability of follow.
“Theorem 1.1. There is a real number α3 ∈ (0,∞) such that, for every fixed real a ≥ 0, limn→∞ p(n, ⌊an⌋) = {1, a < α3, 0, a > α3. There is one finite deterministic Turing machine which, on input 1^r for any integer r ≥ 1, halts with a rational number qr satisfying |qr − α3| ≤ 2^−r. Its only input is the unary precision 1^r; it uses no oracle, advice, or noncomputable real constant.” · Show in paper