# 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

**Wikidata**: [Q2635326](https://www.wikidata.org/wiki/Q2635326)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Structured_program_theorem)  
**Source**: https://4ort.xyz/entity/structured-program-theorem


## References

1. Freebase Data Dumps. 2013
2. [OpenAlex](https://docs.openalex.org/download-snapshot/snapshot-data-format)