, Volume 10, Issue 1, pp 19-32

Relativization of questions about log space computability

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Research supported by NSF Grant No. GJ 43264.
Research supported by NSF Grant No. DCR 92373.