This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Korec, I., A complexity valuation of the partial recursive functions following the expectation of length of their computations on Minsky machines. AFRNUC MATHEMATICA, XXIII (1969), 53–112.
Stoss, H.J., k-Band-Simulation von k-Kopf-Turing-Maschinen, Computing, 6 (1970), 309–317.
Hartmanis, J., Stearns, R.E., On the computational complexity of algorithms, Trans. Amer. Soc., May (1965), 285–306.
Malćev, A.I., Algorithms and recursive functions (in Russian), Moscow, 1965.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benešová, M., Korec, I. (1975). Non-linear speed-up theorem for two register minsky machines. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_193
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_193
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive