# Is a turing machine with random number generator more powerful?

Let's extend the Turing machine so that it can read from a stream of random number generators (in addition to an infinite tape to read and write). Certainly the TM with randomness can do whatever a classical TM do, but what about the converse?

One can argue that the classical TM will always generate the same result given the same input, while the TM with randomness can behave randomly, it can do more. But, then random-valued functions are not really what we call computable. I am aware of randomized algorithms and BPP and what not, but is there an extension of computability that deals with these kind of questions?

• You answered the complexity question for yourself (BPP captures efficient probabilistic algorithms). As for computability, it's easy to see that a classical TM can simulate a probabilistic TM given an exponential blow-up in runtime. Intuitively, if a probabilistic TM uses n random bits, then a classical TM can try all $2^n$ paths corresponding to the possible random bit sequences. So, probabilistic TMs cannot decide a larger class of functions than classical TMs. The outstanding question is whether they can compute certain functions faster. – Huck Bennett Apr 24 '12 at 18:58
• Welcome to cstheory, a Q&A site for research-level questions in theoretical computer science (TCS). Your question does not appear to be a research-level question in TCS. Please see the FAQ for more information on what is meant by this and suggestions for sites that might welcome your question. Finally, if your question is closed for being out of scope, and you believe you can edit the question to make it a research-level question, please feel free to do so. Closing is not permanent and questions can be reopened, check the FAQ for more information. – Kaveh Apr 24 '12 at 19:03
• @David: After looking at the links, I'm still not sure that I follow. My concerns are the following: (1) "Almost surely" halting is not the same as halting. It seems that the issue you raise is dependent on a different definition of "computable". (2) Given a probabilistic TM which is guaranteed to halt on every input, meaning that only a finite number of random bits may be used by the probabilistic TM, we can simulate it with a classical TM by trying the algorithm with all bit sequences of length 1,2,... This procedure will halt even if we have no a priori time bound on the probabilistic TM. – Huck Bennett Apr 24 '12 at 22:49
• @Suresh: I do not think that the issue raised by David Harris is at the research level, either. Of course, the model becomes equivalent to RE under a certain definition of “computable,” but that does not make the issue interesting. – Tsuyoshi Ito Apr 24 '12 at 22:54
• I found a related question here cstheory.stackexchange.com/questions/2515/… – Memming Apr 25 '12 at 13:34

seems like an active, even central/core area of current research under the heading of "exact power of derandomization". its basically an open question with various open complexity class separations whether randomization adds power, or doesnt. theres also a deep connection to the $\mathsf{P \stackrel{?}{=}NP}$ problem in the natural proofs result of razborov/rudich which shows that, loosely, a $\mathsf{P \neq NP}$ proof would likely allow one to "break" what are now conjectured as "secure" random number generators.