Relativization of questions about log space computability
- Cite this article as:
- Ladner, R.E. & Lynch, N.A. Math. Systems Theory (1976) 10: 19. doi:10.1007/BF01683260
- 99 Downloads
A notion of log space Turing reducibility is introduced. It is used to define relative notions of log space,ℒA, and nondeterministic log space,. These classes are compared with the classes and which were originally defined by Baker, Gill, and Solovay [BGS]. It is shown that there exists a computable setA such that. Furthermore, there exists a computable setA such that and. Also a notion of log space truth table reducibility is defined and shown to be equivalent to the notion of log space Turing reducibility.