Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:structured_program_theorem
|
| gptkbp:citation |
gptkb:Edsger_Dijkstra's_'Go_To_Statement_Considered_Harmful'
|
| gptkbp:field |
gptkb:programming_language
computer science |
| gptkbp:impact |
elimination of goto statements in programming
|
| gptkbp:influenced |
structured programming
|
| gptkbp:publishedIn |
gptkb:Communications_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Turing_completeness
goto statement |
| gptkbp:requires |
Any computable function can be computed using only three control structures: sequence, selection, and iteration.
|
| gptkbp:statedIn |
gptkb:Corrado_Böhm
gptkb:Giuseppe_Jacopini |
| gptkbp:yearProposed |
1966
|
| gptkbp:bfsParent |
gptkb:Corrado_Böhm
|
| gptkbp:bfsLayer |
5
|
| http://www.w3.org/2000/01/rdf-schema#label |
Böhm–Jacopini theorem
|