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 its oracle at the current input, outputs either A(x) or a don't-know symbol on any given input x, and outputs A(x) for infinitely many x. If in addition the oracle Turing machine terminates on all inputs and oracles, A is called i.o. truth-table-autoreducible. We obtain the somewhat counterintuitive result that every Martin-L

• Type: Conference
• Year: 2000
• Where: MFCS
• Authors: Todd Ebert, Heribert Vollmer
• Keywords: Martin-l¨of Random Sequences, MFCS 2000, Oracle Turing Machine, Random Sequences, Theoretical Computer Science