This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Gregušová, Ľ., The Construction of "Small" Universal Minsky Machine. Journal of Electrotechnical Faculty of STU, ALFA Bratislava, 1979, (in print, in Slovak).
Gregušová, Ľ., Doctoral Thesis, Faculty of Sciences of Comenius University, Bratislava, 1978, (in Slovak).
Korec, I., A Complexity Valuation of the Partial Recursive Functions Following the Expectation of the Time... Acta F. R. N. Univ. Comen. — Mathematica XXIII, 1969, 53–112.
Korec, I., Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at most seven (eight) Instructions. Proceedings of MFCS 1977, Lecture Notes in Computer Science 53, 324–332.
Malcev, A. I., Algorithms and Recursive Functions. Izd. NAUKA, Moscow, 1965 (in Russian).
Minsky, M. L., Computation, Finite and Infinite Machines, Prentice Hall, New Jersey, 1967.
Sierpiński, W., Theory of Numbers. Warszawa — Wroclaw, 1950, (in Polish).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gregušová, Ľ., Korec, I. (1979). Small universal Minsky machines. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_28
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive