# Separations by random oracles and “Almost” classes for generalized reducibilities

- 5 Citations
- 909 Downloads

## Abstract

Given two binary relations ⩽_{r} and ⩽_{s} on 2^{ω} which are closed under finite variation (of their set arguments) and a set *X* chosen randomly by independent tosses of a fair coin, one might ask for the probability that the lower cones \(\left\{ {A \subseteq \omega :A \leqslant _r X} \right\} and \left\{ {A \subseteq \omega :A \leqslant _3 X} \right\}\)w.r.t. ⩽_{r} and ⩽_{s} are different. By closure under finite variation, the Kolmogorov 0–1 Law yields immediately that this probability is either 0 or 1; in the case it is 1, the relations are said to be separable by random oracles. Again by closure under finite variation, the probability that a randomly chosen set *X* is in the upper cone of a fixed set *A* w.r.t. ⩽_{r} is either 0 or 1. *Almost*_{ r } is the class of sets for which the upper cone w.r.t. ⩽_{r} has measure 1.

In the following, results about separations by random oracles and about Almost classes are obtained in the context of generalized reducibilities, that is, for binary relations on 2^{ω} which can be defined by a countable set of total continuous functionals on 2^{ω} in the same way as the usual resource bounded reducibilities are defined by an enumeration of appropriate oracle Turing machines. The concept generalized reducibility comprises all natural resource bounded reducibilities, but is more general; in particular, it does not involve any kind of specific machine model or even effectivity. From the results for generalized reducibilities, one obtains corollaries about specific resource bounded reducibilities, including several results which have been shown previously in the setting of time or space bounded Turing machine computations.

## Preview

Unable to display preview. Download preview PDF.

## References

- [Am86a]K.Ambos-Spies. Randomness, relativizations, and polynomial reducibilities.
*Proc. First Structure in Complexity Theory Conference*, Lecture Notes in Computer Science Vol. 223, Springer Verlag, Heidelberg New York, 1986, 23–34.Google Scholar - [Am86b]K.Ambos-Spies. Randomness, relativizations, and polynomial reducibilities.
*Unpublished research paper*, 1986.Google Scholar - [BDG]J.L.Balcázar, J.Díaz, J.Gabarró.
*Structural Complexity I and II*. Springer Verlag, Heidelberg New York, 1988 and 1990.Google Scholar - [BG81]C.H. Bennett, J. Gill. Relative to a random oracle
*A, P*^{A}≠*NP*^{A}≠*co*—*NP*^{A}with probability 1.*SIAM Journal on Computing*10 (1981), 96–113.CrossRefGoogle Scholar - [BLM94]R.V. Book, J.H. Lutz, D.M. Martin Jr. The global power of additional queries to random oracles.
*Symposium on Theoretical Aspects of Computer Science*1994, Lecture Notes in Computer Science 775, Springer Verlag, Heidelberg New York, 1994, 403–414.Google Scholar - [BLW94]R.V. Book, J.H. Lutz, K.W. Wagner. An observation on probability versus randomness with applications to complexity classes.
*Mathematical Systems Theory*27 (1994), 201–209.Google Scholar - [BT91]R.V. Book, S. Tang. Polynomial-time reducibilities and almost all oracle sets.
*Theoretical Computer Science*81 (1991), 35–47.Google Scholar - [Od89]P.Odifreddi.
*Classical Recursion Theory*. North Holland, Amsterdam, 1989.Google Scholar