|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 listsType the title of a new list here Computer Laboratory Security Group meeting presentations CHUCOL seminars
Other talksEarthquake Induced Soil Liquefaction: Symptoms and Cures Free speech and seditious libel: James Gillray and the crisis of Revolution When a stone is not a stone: doing alchemy with plants and animals SciScreen: Golden Genes Neuroimaging of the emergence of cognition in infants and its clinical applications SuperWASP, the Rossiter-McLaughlin effect, and Doppler Tomography