COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Applied and Computational Analysis > Undecidability in geometry and topology
Undecidability in geometry and topologyAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dr Hansen. There is a beautiful tension in topology between positive classification theorems and negative “no-go” theorems. The positive results come from geometry, and often derive ultimately from analysis. The negative results, by contrast, come from undecidability results in logic. I’ll give a survey of the history of this tension, and mention the highlight theorems — examples include Markov’s theorem that 4-manifolds cannot be classified (on the negative side), and Perelman’s Geometrization Theorem in dimension 3 (on the positive side). I’ll then go on to describe some recent undecidability results, which limit possible computations in matrix groups. This is joint work with Martin Bridson. This talk is part of the Applied and Computational Analysis series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMajor Public Lectures in Cambridge MedSin Cambridge CUPORTSS Cambridge Food Security Forum South Asia Film Series Department of Earth Sciences Seminars (downtown)Other talksPractical Steps to Addressing Unconscious / Implicit Bias Comparative perspectives on social inequalities in life and death: an interdisciplinary conference Synthesising Molecular Function: Shape Matters |