|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 listsEurocrisis Conference 14-15 June Babbage Lecture Series Cambridge Comparative Syntax Conference (CamCoS)
Other talksPublic Health Annual Lecture Making Shale Oil and Gas Production Safer and More Efficient Understanding estrogen receptor-mediated gene regulation in breast cancer Building a Start-up from Cam’lab Research Evidence for a significant contribution of rare bright sources to the ionising UV background at z~ 5.6-5.8 Prevention is Better than Cure: closing lecture by the Vice Chancellor