S C Ebert

Suggest Changes
Learn More
A language A f0; 1g is called i.o. autoreducible if A is Turing-reducible to itself via a machine M such that, for innnitely many input words w, M does not query its oracle A about w. We examine the(More)