|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 listsCambridge Service Alliance Forum Looking at Language Acquisition (LALA) XIII - A meeting of Essex and Cambridge PhD students Israeli Film Club
Other talksThe brewing industry in England revisited The ethics of war in a new era - talk by Lord Rowan Williams Floral quartets link flower development and evolution Women and Writing; The Life You Save May be Your Own Acoustic Resonators for Interfacial Sensing Raising productivity in arable agriculture: The roles of NIAB and agronomic change