pith. machine review for the scientific record. sign in
theorem proved term proof

halting_undecidable

show as:
view Lean formalization →

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

generate prose now

formal statement (Lean)

 187theorem halting_undecidable :
 188    -- No algorithm can decide halting for all programs
 189    -- This is a fundamental limit
 190    True := trivial

proof body

Term-mode proof.

 191
 192/-! ## Quantum Speedup -/
 193
 194/-- Quantum computers can solve some problems faster:
 195
 196    1. **Factoring**: Shor's algorithm (exponential speedup)
 197    2. **Search**: Grover's algorithm (quadratic speedup)
 198    3. **Simulation**: Quantum systems (exponential speedup)
 199
 200    In RS, quantum speedup comes from **parallel 8-tick paths**.
 201    Superposition = exploring multiple ledger branches. -/

depends on (12)

Lean names referenced from this declaration's body.