|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 lists2013 UK~IRC Innovation Summit East Asia Institute Seminars Enterprise Tuesday 2009/2010
Other talksLocal Names Day 2 - Corporate Finance Theory Symposium 2015 Sterile neutrino dark matter: galaxy formation and other stories Cell Culture 2016 Circuit adaptations underlying drug addiction: mechanisms and therapeutic implications 'The cultural self-fashioning of Frederick the Great'