University of Cambridge > Talks.cam > Applied and Computational Analysis > Can everything be computed? On the Solvability Complexity Index and towers of algorithm.

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

Download to your calendar using vCal

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 lists

West Forvie Building, Seminar Room, Robinson Way, Cambridge cambridge architecture society cancer

Other talks

Optimal metric and approximation of free boundary minimal surfaces Group Work title abstract tbc Shape modes of CP^1 vortices César Milstein Lecture - Title TBC Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity