Search results
We did not find results for: What is structured program theorem?.
Check spelling or type a new query.
We did not find results for: What is structured program theorem?.
Check spelling or type a new query.
Theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration
The structured program theorem, also called the Böhm–Jacopini theorem, is a result in programming language theory. It states that a class of control-flow graphs (historically called flowcharts in this context) can compute any computable function if it combines subprograms in only three specific ways (control structures). These are Wikipedia