|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 listsConference "Continuity and Change in Grammar" Type the title of a new list here Test de ligne de prière
Other talksA Defence of Mathematical Modelling in Economics Trapping Mink for Water Vole recovery in the upper Cam catchment Circadian regulation of Inflammation Genetic instability - observation and concepts Changes in the Global Carbon Cycle over the last 800,000 years - an ice core perspective The Making of Measurement