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