People: Prof. Dr. Tobias Friedrich, Dr. Samuel Baguley
Links: Moodle to follow

The lecture will be held in English.

Probability and randomness are a central topic in modern computer science. However, probabilistic results can be unintuitive and seem paradoxical. This lecture will cover various problems and paradigms in probability theory.

The topics of this lecture will include:

• Classic probabilistic problems relevant to computer science, like the coupon collector and birthday paradox
• The St Petersburg Game, Pascal's mugging, and the dangers of optimising for expected return
• Apparent paradoxes, e.g. the two envelopes problem, Monty Hall
• Problems of manipulating probabities, e.g. intransitive dice
• How to lie with statistics

The participants are expected to have basic mathematical knowledge and an interest in rigorous analysis of algorithms. A background in probability theory is not required. Any new concepts will will be covered in the lecture.

A short homework will be set each week.

For the exam, students will write a short report in pairs on a relevant topic - chosen from a selection, with problems to solve. There will be an oral exam to discuss the report.

The time slots for this lecture are:

• Tuesdays: 15:15-16:45 in K-2.04.

The following people are involved in this lecture: