Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Van Ba N., Address machines and their programs, Warszawa, 1972

    Google Scholar 

  2. Barański H., About computations in address machines, Warszawa, 1972

    Google Scholar 

  3. Bartol W., Dynamic programs of computations, Warszawa, 1973

    Google Scholar 

  4. Elgot C.C., Robinson A., Random-access stored-program machines, Journal of ACM 11 (1964), 365–399.

    Google Scholar 

  5. Engeler E., Notes for Math. University of Minnesota.

    Google Scholar 

  6. Hotz G., Grundlagen einer Theorie der Programmierungsprachen, Universitat des Saarlandes, Saarbrucken.

    Google Scholar 

  7. Kwasowiec W., Instructions of address machines, Warszawa, 1972.

    Google Scholar 

  8. Maurer W.D., A theory of computer instructions, Journal of ACM 13 (1966), 226–235.

    Google Scholar 

  9. Orgass R.J., Fitch F.B., A theory of computing machines, Studium Generale, 22 (1969), 83–104.

    Google Scholar 

  10. Pawlak Z., On the notion of a computer, Logic Math. and Phil. Sci., 3 (1968), 255–267.

    Google Scholar 

  11. Pawlak Z., Stored program machines, Algorytmy 10 (1969), 5–19.

    Google Scholar 

  12. Raś Z., Algebraization of the notion of semiprogram in an address machine, Warszawa, 1972

    Google Scholar 

  13. Rozenberg G., Constant-program machines are universal for a class of countable machines, manuscript

    Google Scholar 

  14. Wagner E.G., Bounded action machines, Journal of Computer and System Sciences, 2 (1968), 13–75.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Pawlak, Z. (1973). A mathematical model of digital computers. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039134

Download citation

  • DOI: https://doi.org/10.1007/BFb0039134

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics