@article{KYB_1979_15_2_a1,
author = {Nekvinda, Miloslav},
title = {Memory complexity of countable functions},
journal = {Kybernetika},
pages = {88--99},
year = {1979},
volume = {15},
number = {2},
mrnumber = {0542055},
zbl = {0407.68052},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1979_15_2_a1/}
}
Nekvinda, Miloslav. Memory complexity of countable functions. Kybernetika, Tome 15 (1979) no. 2, pp. 88-99. http://geodesic.mathdoc.fr/item/KYB_1979_15_2_a1/
[1] J. Hartmanis P. M. Lewis II R. E. Stearns: Classifications of computations by time and memory requirements. IFIP Congress in New York, 1965.
[2] H. Yamada: Counting by a class of growing automata. PhD Thesis, Moore School of Elect. Eng., University of Pennsylvania (1960).
[3] H. Yamada: Real-time computation and recursive functions not real time computable. IRE Trans. on Electronic Computers, EC-11 (1960). | MR
[4] P. C. Fischer A. R. Meyer A. L. Rosenberg: Time-restricted sequences generation. Journal of Computer and System Sciences 4, (1970) 50-73. | MR
[5] M. Nekvinda: On the complexity of events recognizable in real time. Kybernetika 9, (1973), 1, 1-10. | MR | Zbl
[6] M. Nekvinda: On the complexity of countable functions. Proceedings of Symposium and Summer School on Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia, 1973. | MR