This mini-course will cover topics on the interaction of randomness with computation. In some of the topics, randomness will make computation easy. In others, it will make it hard. And in others, it will make it both. The lecture plan may be adjusted, either to cover necessary background material, or as a function of the interests of the audience.

- Day 2: Resampling Oracles. A general theorem about focused local search. Commutativity in LLL. Partially Observable Markov Decision Processes.