The DOI matches its Crossref record.
Flow diagrams, turing machines and languages with only two formation rules
Open accessAbstract
In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself.Although not every diagram is decomposable into a finite numbm of given base diagrams, this becomes hue at a semantical level due to a suitable extension of the given set and of the basic mappings defined in it.Two normalization methods of flow diagrams are given.The first has |hree base diagrams; the second, only two.In the second part of the paper, the second method is applied to 'lhe theory of Turing machines.With every Turing maching provided with a two-way half-tape, ihere is associated a similar machine, doing essentially 'lhe same job, but working on a tape obtained from the first one by interspersing alternate blank squares.The new machine belongs to the family, elsewhere introduced, generated by composition and iteration from the two machines X and R.That family is a proper subfamily of the whole family of Turing machines.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Letters to the editor: go to statement considered harmful
Dijkstra, E. W. (1968) · Communications of the ACM · doi:10.1145/362929.362947 · Cited by 1,026
Structured Programming with go to Statements
Knuth, D. E. (1974) · ACM Computing Surveys · doi:10.1145/356635.356640 · Cited by 678
Dependence graphs and compiler optimizations
Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567555 · Cited by 651
Conversion of control dependence to data dependence
Allen, J. R., Kennedy, K., Porterfield, C., & Warren, J. (1983) · Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83 · doi:10.1145/567067.567085 · Cited by 609
Flowchart techniques for structured programming
Nassi, I., & Shneiderman, B. (1973) · ACM SIGPLAN Notices · doi:10.1145/953349.953350 · Cited by 534
Metadata
- Authors
- Böhm, C., & Jacopini, G.
- Venue
- Communications of the ACM
- Published
- 1966-05
- Volume
- 9
- Issue
- 5
- Pages
- 366-371
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2102075452
- Cited by
- 791
- References
- 0
- FWCI
- 2.72
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Flow diagrams, turing machines and languages with only two formation rules. https://app.cochat.ai/papers/10.1145/355592.365646
- The paper
- Böhm, C., & Jacopini, G. (1966). Flow diagrams, turing machines and languages with only two formation rules. Communications of the ACM. https://doi.org/10.1145/355592.365646
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.