|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 listsBiophysical Colloquia From Genotype to Phenotype: Resources and Challenges (10th June 2009, Hinxton) Holocaust Memorial Day
Other talksCardiovascular Development: Insights into Regeneration Majorana metals and quantum spin liquids Ash, Ice, Mud: Tephras and Rapid Climate Changes Struggle to maintain Kabyle identity in Algeria Strong-coupling ansatz for the one-dimensional Fermi gas in a harmonic potential ANOVA of balanced multi-factorial designs: between subject designs, and single subject studies