A Turing machine oracle hierarchy. I.
Commentationes Mathematicae Universitatis Carolinae (1980)
- Volume: 021, Issue: 1, page 11-26
- ISSN: 0010-2628
Access Full Article
top
How to cite
topŽák, Stanislav. "A Turing machine oracle hierarchy. I.." Commentationes Mathematicae Universitatis Carolinae 021.1 (1980): 11-26. <http://eudml.org/doc/17013>.
@article{Žák1980,
author = {Žák, Stanislav},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {oracle Turing machine; complexity measures; number of questions; length of equations; diagonalization},
language = {eng},
number = {1},
pages = {11-26},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {A Turing machine oracle hierarchy. I.},
url = {http://eudml.org/doc/17013},
volume = {021},
year = {1980},
}
TY - JOUR
AU - Žák, Stanislav
TI - A Turing machine oracle hierarchy. I.
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1980
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 021
IS - 1
SP - 11
EP - 26
LA - eng
KW - oracle Turing machine; complexity measures; number of questions; length of equations; diagonalization
UR - http://eudml.org/doc/17013
ER -
References
top- ROGERS H., Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967. (1967) Zbl0183.01401MR0224462
- SIMON I., On some subrecursive reducibilities, Tech. Rep. STAN-CS-77-608, June 1977. (1977)
- ŽÁK S., A Turing machine space hierarchy, Kybernetika 15, 2 (1979), 100-121. (1979) MR0542056
Citations in EuDML Documents
topNotesEmbed ?
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.