|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Can everything be computed? On the Solvability Complexity Index and towers of algorithm.
If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.
In this talk we will discuss some of the foundations of computational mathematics. In particular, I will ask the rather fundamental questions: “Can everything be computed?” and: “In what way?” and discuss possible ways to answer them. This is done by linking some new developments in computational mathematics (in particular the Solvability Complexity Index and towers of algorithms) to some of the fundamental works of Godel, McMullen and Smale.
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 listsCavendish Physical Society French Graduate Research Seminar 2008/2009 Computational Radiotherapy
Other talksHow to give good talks Woofing it down – lessons on the neurobiology of appetite from man’s best friend Managed by an Algorithm? The rise of “on-demand working” and the “gig economy” The Quantified Self at Work After Brexit: The Future of Poles in the UK Cell biological mechanisms regulating vertebrate neurogenesis