|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 listsCancer Research UK Cambridge Institute seminars Tracing Human Ancestry, using DNA
Other talksImagining ill bodies: the Basel Mission doctors and images from the Gold Coast, 1885–1914 The gift of Krishna: India, piracy and the littoral politics of Empire Wolf - A Social and Cultural Creature: Implications for Conservation Tunnelling Under Cities, Advances in Research and Practice Corner effects on shock-induced separation Some observations on a fractional Cahn Hilliard equation and its relations with the fractional Porous Medium equation