The Böhm–Jacopini Theorem Is False, Propositionally (Q3521987): Difference between revisions

@@ Property / cites work @@
+Flow diagrams, turing machines and languages with only two formation rules
+Normal rank
@@ Property / cites work @@
+Regular expressions and the equivalence of programs
+Normal rank
@@ Property / cites work @@
+Q4061932
@@ Property / cites work: Q4061932 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5693581
@@ Property / cites work: Q5693581 / rank @@
+Normal rank
@@ Property / cites work @@
+Unravelling Unstructured Programs
@@ Property / cites work: Unravelling Unstructured Programs / rank @@
+Normal rank
@@ Property / cites work @@
+On the capabilities of while, repeat, and exit statements
+Normal rank
@@ Property / cites work @@
+Eliminating go to's while preserving program structure
+Normal rank
@@ Property / cites work @@
+Conversion of Unstructured Flow Diagrams to Structured Form
+Normal rank