structured program theorem
Sign in to saveAlso known as Böhm-Jacopini theorem, Dijkstra's 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 facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- Edsger W. Dijkstra
Show 3 more facts
- time of discovery or invention
- 1966-00-00
- discoverer or inventor
- Corrado Böhm
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0