Böhm–Jacopini theorem

The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.