structured program theorem

Also known as Böhm-Jacopini theorem, Dijkstra's theorem

theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration