skip to main content
article
Free Access

Flow diagrams, turing machines and languages with only two formation rules

Authors Info & Claims
Published:01 May 1966Publication History
First page image

References

  1. 1 PETER, R. Graphschemata und rekursive Funktionen. Dialectica 12 (1958), 373-393.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2 Goas, S. Specification languages for mechanical languages and their processors. Comm. ACM. 4, (Dec. 1961), 532-542. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 HERMES, H. Aufzghlbarkeit, Entscheidbarkeit, Berechenbarkeit. Springer Verlag, Berlin, 1961.Google ScholarGoogle Scholar
  4. 4 CIAMPA, S. Un'applicazione della teoria dei graft. Atli del Convegno Nazionale di Logica, Torino 5-7 (April 1961), 73-80.Google ScholarGoogle Scholar
  5. 5 RIGUET, J. Programmation et theorie des categories. Proc. ICC Syrup. Symbolic Languages in Data Processing, Gordon and Breach, New York, 1962, 83-98.Google ScholarGoogle Scholar
  6. 6 IANOV, Yu, I. On the equivalence and transformation of program schemes. Dokl. Akad. Nauk SSSR 113, (1957), 39-42. (Russian).Google ScholarGoogle Scholar
  7. 7 ASSER, G. Functional algorithms and graph schema. Z. Math. Logik u. Grundlagen Math., 7, (1961), 20-27.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8 BOHM, C. On a family of Turing machines and the related programming language. ICC Bull. 3, (July 1964), 187-194.Google ScholarGoogle Scholar
  9. 9 BOHM, C., JACOPINI, G. Nuove tecniche di programmazione semplificanti la sintesi di macchine universuli di Turing. Rend. Acc. Naz. Lincei {8}, 32, (June 1962), 913-922.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 9, Issue 5
    May 1966
    100 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/355592
    Issue’s Table of Contents

    Copyright © 1966 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 May 1966

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader