ALMOST-R: characterizations using different concepts of randomness
Abstract
We study here the classes of the form ALMOST-R, for R a reducibility. This includes among other the classes BPP, P and PH. We give a characterization of this classes in terms of reducibility to n-random languages, a subclass of algorithmically random languages. We also give a characterization of classes of the form ALMOST-R in terms of resource bounded measure, for R reducibility of a restricted kind.
Full text
ALMOST-'R: Cha ac e iza ions using Di e en
Concep s o Randomness
Ronald V. Book
Depa men o Ma hema ics
U ni e si y o Cali o nia
San a Ba ba a, CA 93106 USA
(
e-mail: bo[email p o ec ed])
and
El i a Mayo domo*
Depa amen L. S. I.
Uni e si a Poli ecnica de Ca alunya
Pau Ga gallo 5
08028 Ba celona, Spain
(
e-mail: mayo dom[email p o ec ed])
Abs ac
We s udy he e he classes o he o m ALMOST-R, o R a educibili y. This
includes among o he he classes BPP, P and PH. We gi e a cha ac e iza ion o his
classes in e ms o educibili y o n- andom languages, a subclass o algo i hmically
andom languages. We also gi e a cha ac e iza ion o classes o he o m ALMOST-R
in e ms o esou ce bounded measu e, o R educibili y o a es ic ed kind.
•suppo ed by a Spanish Go e nmen G an FPI PN90. This wo k was done while isi ing he Uni e si y
o Cali o nia, suppo ed by his g an .
55