Meanings
- computingA theorem stating that a class of control flow graphs can compute any computable function using only sequences, selections, and iterations.
Synonyms: structured program theorem
Synonyms & antonyms
proper nounA theorem stating that a class of control flow graphs can compute any computable function using only sequences, selections, and iterations.
Origin
Developed by Corrado Böhm and Giuseppe Jacopini.
Full word history & related roots →Cite this entry
Böhm-Jacopini theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/B%C3%B6hm-Jacopini%20theorem
“Böhm-Jacopini theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/B%C3%B6hm-Jacopini%20theorem. Accessed November 5, 2026.
WatkinsX Dictionary, s.v. “Böhm-Jacopini theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/B%C3%B6hm-Jacopini%20theorem.
Source: Böhm-Jacopini theorem on Wiktionary, CC BY-SA 4.0.