Sciweavers

55
Voted
MFCS
2000
Springer
15 years 12 days ago
On the Autoreducibility of Random Sequences
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
Todd Ebert, Heribert Vollmer