Preview
Unable to display preview. Download preview PDF.
References
Van Ba N., Address machines and their programs, Warszawa, 1972
Barański H., About computations in address machines, Warszawa, 1972
Bartol W., Dynamic programs of computations, Warszawa, 1973
Elgot C.C., Robinson A., Random-access stored-program machines, Journal of ACM 11 (1964), 365–399.
Engeler E., Notes for Math. University of Minnesota.
Hotz G., Grundlagen einer Theorie der Programmierungsprachen, Universitat des Saarlandes, Saarbrucken.
Kwasowiec W., Instructions of address machines, Warszawa, 1972.
Maurer W.D., A theory of computer instructions, Journal of ACM 13 (1966), 226–235.
Orgass R.J., Fitch F.B., A theory of computing machines, Studium Generale, 22 (1969), 83–104.
Pawlak Z., On the notion of a computer, Logic Math. and Phil. Sci., 3 (1968), 255–267.
Pawlak Z., Stored program machines, Algorytmy 10 (1969), 5–19.
Raś Z., Algebraization of the notion of semiprogram in an address machine, Warszawa, 1972
Rozenberg G., Constant-program machines are universal for a class of countable machines, manuscript
Wagner E.G., Bounded action machines, Journal of Computer and System Sciences, 2 (1968), 13–75.
Rights 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