|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 listsQueens' Linguistics Fest 2012 Alfaisal University Engineering Seminars Cambridge Carbon Footprint
Other talksThe Colonisation of the Future: An Alternative View of Financialisation and its Portents Targeted nanoparticles for mitochondrial medicine Generalised Multinomial Logit with Posterior Analysis: Exploring Willingness-to-Pay for Grid Resilience Imaging organ development and function in zebrafish 'Fabulas' Crassulas Back to basics: fundamentals forces in protein structure, design & interactions