Computability Learning Seminar

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Algorithmic Randomness and Complexity"

We begin a new series of talks exploring the concept of what it means for mathematical objects (encoded as binary sequences) to be random. This relates strongly to Computability Theory, and so to make the talks accessible to all who are interested, a brief introduction to Computability will be given.

Microsoft Teams meeting: https://teams.microsoft.com/l/meetup-join/19%3ameeting_MWJhYTA5MTctODg3Yi00MGViLWIwMzUtMzVhOGMxZjMwOGFl%40thread.v2/0?context=%7b%22Tid%22%3a%22723a5a87-f39a-4a22-9247-3fc240c01396%22%2c%22Oid%22%3a%220e881c55-96f3-4d21-916a-fc7a001a9f49%22%7d