turkmath.org

Classification problems have always been a central theme in mathematics. Consequently, one may wonder whether or not it is possible to measure the ''difficulty'' of a classification problem. Over the last couple decades, descriptive set theory has successfully provided a framework to rigorously measure the relative complexity of classification problems from diverse areas of mathematics. In the first half of this talk, we shall introduce this framework and briefly summarize some key results and their implications. In the second half of this talk, we shall focus on some classification problems from topological dynamics and present some of our own results. No prior knowledge on the topic will be assumed.