|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 listsKazakhstan’s Bid to Secure a Non-permanent Seat on the UN Security Council for 2017-18 Sainsbury Laboratory Seminars Mental Health, Religion & Culture
Other talksThe 2017 Sports Science Summit Capitalism on the Edge - Capitalism on Stage Many-body interaction effects in Dirac-Weyl semimetals "Exploring dependence between categorical variables: Benefits and limitations of using variable selection within Bayesian clustering in relation to searching for interactions" Bacterial targeting of small GTPases to manipulate endocytic recycling Microglia proliferation in health and disease