Abstract
It is shown that there is a recursive oracleD such that
, thereby answering an open question of Ladner and Lynch [5]. Here\(\mathfrak{L}\) and\(\mathfrak{N}\mathfrak{L}\) denote the class of languages accepted in deterministic, respectively nondeterministic, space logn.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Angluin, On Relativizing Auxiliary Pushdown Machines,Math. Systems Theory 13 (1980), 283–299.
T. Baker, J. Gill, and R. Solovay, Relativization of the P = ?NP Question,SIAM J. Computing 4 (1975), 431–442.
J. E. Hopcroft and J. D. Ullman,Intro. to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
C. M. R. Kintala and P. C. Fischer, Computations with a Restricted Number of Nondeterministic Steps,9th STOC, 1977, 178–185.
R. E. Ladner and N. A. Lynch, Relativization of Questions About Log Space Computability,Math. Systems Theory 10 (1976), 19–32.
N. Lynch, Log Space Machines with Multiple Oracle Tapes,Theoretical Comp. Sc. 6 (1978), 25–39.
W. L. Ruzzo, J. Simon, and M. Tompa, Space-Bounded Hierarchies and Probabilistic Computations,14th STOC, 1982, 215–223.
I. Simon, On some subrecursive reducibilities, Ph.D. dissertation, Computer Science Dept., Stanford Univ., 1977, Report No. STAN-CS-77–608.
Author information
Authors and Affiliations
Additional information
This work was supported by NSF Grant MCS-8001963.
Rights and permissions
About this article
Cite this article
Savitch, W.J. A note on relativized log space. Math. Systems Theory 16, 229–235 (1983). https://doi.org/10.1007/BF01744581
Issue Date:
DOI: https://doi.org/10.1007/BF01744581