Recursive functions computable within $C \bar f \log\bar f$
Kybernetika, Tome 5 (1969) no. 5, pp. 384-399
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1969_5_5_a2,
author = {Ho\v{r}ej\v{s}, Ji\v{r}{\'\i}},
title = {Recursive functions computable within $C \bar f \log\bar f$},
journal = {Kybernetika},
pages = {384--399},
year = {1969},
volume = {5},
number = {5},
mrnumber = {0284342},
zbl = {0181.30501},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1969_5_5_a2/}
}
Hořejš, Jiří. Recursive functions computable within $C \bar f \log\bar f$. Kybernetika, Tome 5 (1969) no. 5, pp. 384-399. http://geodesic.mathdoc.fr/item/KYB_1969_5_5_a2/
[D] Davis M.: Computability and Unsolvability. New York 1958. | MR | Zbl
[H] Hennie F. C: One-tape, Off-line Turing computations. Inf. Control 8 (1965), 553-578. | MR
[M] Myhill J.: Linear bounded automata. Wright Air Development Division Ohio, Report (1960), 60-22.
[T] Трахтенброт Б. A.: Тыюриговы вычисления с логарифмическим замедлением. Алгебра и логика 3 (1964), 33-48. | MR | Zbl