logarithmic-time

#logarithmic-time

AI agents strengthened Terence Tao's landmark Collatz theorem. For each f(N)→∞, almost every N falls below f(N) within 436 ln N steps. New: natural density and one explicit clock. Not the full conjecture. Lean-verified.

Reddit r/singularity ↗ · 6d ago Cached

A new formal theorem, verified in Lean, shows that for thresholds tending to infinity, almost every positive integer falls below the threshold within 436 log N Collatz steps, strengthening Terence Tao's earlier result with explicit bounds and natural density.

0 favorites 0 likes

logarithmic-time

AI agents strengthened Terence Tao's landmark Collatz theorem. For each f(N)→∞, almost every N falls below f(N) within 436 ln N steps. New: natural density and one explicit clock. Not the full conjecture. Lean-verified.

Submit Feedback