structured program theorem (Q2635326)
theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration
- Böhm-Jacopini theorem
- Dijkstra's theorem
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 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 |
|
Statements
Böhm-Jacopini theorem (English)
Teorema di Bohm-Jacopini (Italian)
0 references
1966
0 references
Identifiers
Sitelinks
Wikipedia(13 entries)
- cawiki Teorema del programa estructurat
- enwiki Structured program theorem
- eswiki Teorema del programa estructurado
- itwiki Teorema di Böhm-Jacopini
- jawiki 構造化定理
- kowiki 구조화 정리
- lmowiki Teorema de Böhm-Jacopini
- plwiki Twierdzenie Böhma-Jacopiniego
- ruwiki Теорема Бёма — Якопини
- simplewiki Structured program theorem
- ukwiki Структурна теорема Бьома — Якопіні
- zh_yuewiki 結構化程式定理
- zhwiki 結構化程式理論