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
Facts
6 properties- Instance of
- theorem
- Part of
- list of theorems[5]
- Described by source
- Communications of the ACM, Lecture Notes in Computer Science[7][8]
- Discoverer or inventor
- Corrado Böhm[2]
- Named after
- Corrado Böhm, Edsger W. Dijkstra[3][4]
- Time of discovery or invention
- 1966[6]
🏷️ Also known as
en Böhm-Jacopini theorem
en Dijkstra's theorem
en structured program theorem
es Teorema de Dijkstra
es teorema del programa estructurado
it Teorema di Bohm-Jacopini
it teorema di Böhm-Jacopini
it Teorema di Jacopini-Bohm
ja 構造化定理
ko 구조화 정리
pl Twierdzenie Böhma–Jacopini'ego
ru Теорема Бёма — Якопини
ru Теорема Бома — Якопини
ru Теорема Бома-Якопини
uk Структурна теорема Бьома-Якопіні
zh 結構化程式理論
zh-hans 结构化程式理论
🔖 Identifiers · 4
- OpenAlex ID
- C180375552
- Encyclopedia of China (Second Edition) ID
- 211850
- Freebase ID
- /m/054ysq
- Microsoft Academic ID (discontinued)
- 180375552
🔗 Connections
Named after 2
Described by source 1
Discoverer or inventor 1
Instance of 1
Maintained by WikiProject 1
Part of 1
Press Enter · cited answer in seconds
0 sources
Summary
structured program theorem is a theorem[1].