|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 listsKettle's Yard 50th anniversary criminology CIDC/Dept. of Veterinary Medicine
Other talksPain and Lessons from the Naked Mole-Rat Defining “Good” in “Good Energy Policy”: Insights from Theologies and Religions The Ageing Cell Conference 2017 Simon Newman: Hidden in Plain Sight: Escaped Slaves in Jamaica The Ideal Self: Flattery in Julius Caesar ZANU’s Post-1980 Legitimation Strategies: Post-Liberation Demobilization via Development Discourse (with Book Launch)