Computability Learning Seminar

Wednesday, January 27, 2021 2:00 pm - 2:00 pm EST (GMT -05:00)
Export this event to calendar
iCal

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Algorithmic Randomness and Complexity (Part II)"

We pick up where we left off in discussing measures of randomness for finite binary strings.

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