Böhm-Jacopini theorem
Böhm-Jacopini theorem proper noun: a theorem stating that a class of control flow graphs can compute any computable function using only sequences, selections, and iterations.
Proper noun
the Böhm-Jacopini theorem
- A 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 of Böhm-Jacopini theorem
- structured program theorem
Origin of Böhm-Jacopini theorem
Developed by Corrado Böhm and Giuseppe Jacopini.
Questions about Böhm-Jacopini theorem
- What does Böhm-Jacopini theorem mean?
- Böhm-Jacopini theorem means a theorem stating that a class of control flow graphs can compute any computable function using only sequences, selections, and iterations.
- What part of speech is Böhm-Jacopini theorem?
- Böhm-Jacopini theorem is a proper noun.
Words near Böhm-Jacopini theorem in the dictionary
Source and license
Adapted from Wiktionary: Böhm-Jacopini theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Böhm-Jacopini theorem.” Word.ws, https://word.ws/b%C3%B6hm-jacopini_theorem. Based on Wiktionary, CC BY-SA 4.0.
