A Turing machine oracle hierarchy. II.
Commentationes Mathematicae Universitatis Carolinae (1980)
- Volume: 021, Issue: 1, page 27-39
- ISSN: 0010-2628
Access Full Article
top
How to cite
topŽák, Stanislav. "A Turing machine oracle hierarchy. II.." Commentationes Mathematicae Universitatis Carolinae 021.1 (1980): 27-39. <http://eudml.org/doc/17014>.
@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 = {27-39},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {A Turing machine oracle hierarchy. II.},
url = {http://eudml.org/doc/17014},
volume = {021},
year = {1980},
}
TY - JOUR
AU - Žák, Stanislav
TI - A Turing machine oracle hierarchy. II.
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1980
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 021
IS - 1
SP - 27
EP - 39
LA - eng
KW - oracle Turing machine; complexity measures; number of questions; length of equations; diagonalization
UR - http://eudml.org/doc/17014
ER -
References
top- ROGERS H., Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967. (1967) Zbl0183.01401MR0224462
- ŽÁK S., A Turing machine oracle hierarchy I, Comment. Math. Univ. Carolinae 21 (1980), 11-26. (1980) MR0566238
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.