Can everything be computed? On the Solvability Complexity Index and towers of algorithm.

Add to your list(s) Download to your calendar using vCal

• Anders Hansen (University of Cambridge)
• Thursday 17 January 2013, 15:00-16:00
• MR 14, CMS.

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:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• DAMTP info aggregator
• Featured lists
• MR 14, CMS

Note that ex-directory lists are not shown.