Non-linear speed-up theorem for two register minsky machines
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)
KeywordsRecursive Function State Symbol Input Register Informal Description Computational Device
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.Stoss, H.J., k-Band-Simulation von k-Kopf-Turing-Maschinen, Computing, 6 (1970), 309–317.Google Scholar
- 3.Hartmanis, J., Stearns, R.E., On the computational complexity of algorithms, Trans. Amer. Soc., May (1965), 285–306.Google Scholar
- 4.Malćev, A.I., Algorithms and recursive functions (in Russian), Moscow, 1965.Google Scholar
© Springer-Verlag Berlin Heidelberg 1975