Recursive functions computable within
Kybernetika (1969)
- Volume: 05, Issue: 5, page (384)-399
- ISSN: 0023-5954
Access Full Article
top
How to cite
topHořejš, Jiří. "Recursive functions computable within $C \bar{f} \log \bar{f}$." Kybernetika 05.5 (1969): (384)-399. <http://eudml.org/doc/28624>.
@article{Hořejš1969,
author = {Hořejš, Jiří},
journal = {Kybernetika},
keywords = {recursion theory, constructive mathematics},
language = {eng},
number = {5},
pages = {(384)-399},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Recursive functions computable within $C \bar\{f\} \log \bar\{f\}$},
url = {http://eudml.org/doc/28624},
volume = {05},
year = {1969},
}
TY - JOUR
AU - Hořejš, Jiří
TI - Recursive functions computable within $C \bar{f} \log \bar{f}$
JO - Kybernetika
PY - 1969
PB - Institute of Information Theory and Automation AS CR
VL - 05
IS - 5
SP - (384)
EP - 399
LA - eng
KW - recursion theory, constructive mathematics
UR - http://eudml.org/doc/28624
ER -
References
top- Davis M., Computability and Unsolvability, New York 1958. (1958) Zbl0080.00902MR0347574
- Hennie F. C, One-tape, Off-line Turing computations, Inf. Control 8 (1965), 553-578. (1965) MR0191769
- Myhill J., Linear bounded automata, Wright Air Development Division Ohio, Report (1960), 60-22. (1960)
- Трахтенброт Б. A., Тыюриговы вычисления с логарифмическим замедлением, Алгебра и логика 3 (1964), 33-48. (1964) Zbl1117.65300MR0183645
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.