Structured program theorem

Control-flow graphs with 3 types of control structures can compute any computable function

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 can compute any computable function if it combines subprograms in only three specific ways. These areExecuting one subprogram, and then another subprogram (sequence) Executing one of two subprograms according to the value of a boolean expression (selection) Repeatedly executing a subprogram as long as a boolean expression is true (iteration)

This keyword could refer to multiple things. Here are some suggestions: