Meetings/Workshops on Information Theory, Foundations of Computer Science in Canada

This workshop focuses on the newly developing connection between computable structure theory, computable analysis, and algorithmic randomness. Historically, computable structure theory has been centered around countable algebraic structures such as algebraically closed fields and linear orders. However, with some care, it is possible to study uncountable structures such as Banach spaces and metric spaces in this context and to define the notion of an algorithmically random structure. This workshop will bring together researchers in these three areas to build on recent advances in the intersection of these topics and develop new questions in and new approaches to this emerging field of study.