Structured program theorem

A theorem stating that every computable function can be implemented using sequence, selection, and iteration, without unrestricted jumps such as GOTO.

Connect