Undecidable Problems

Why it matters

Undecidability limits algorithms. Understanding shapes theoretical bounds.

The architecture

No algorithm terminates deciding for all inputs.

Provable via reduction from halting.

Practical: approximations or restrictions.

How it works end to end

Rice's theorem: non-trivial semantic properties undecidable.

Program equivalence, correctness undecidable in general.