Man has grappled with the meaning and utility of randomness for centuries. This talk describes two main aspects of the research on randomness with respect to the theory of computation, demonstrating respectively its power and weakness for making algorithms faster.