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

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Arabic Language Ideology - A Case of Language Anxiety by Professor Yasir Suleiman Malley, CBE Cambridge University Engineering Society Cambridge Language Sciences Annual Symposium ji247's list Mental Health, Religion & Culture IV EURASIAN RESEARCH FORUM

Other talks

A new proposal for the mechanism of protein translocation Nuclear fuel manufacture at Westinghouse Springfields past, present and future Nonstationary Gaussian process emulators with covariance mixtures Value generalization during human avoidance learning Retinal mechanisms of non-image-forming vision Cambridge - Corporate Finance Theory Symposium September 2017 - Day 2 Statistical Methods in Pre- and Clinical Drug Development: Tumour Growth-Inhibition Model Example 'The Japanese Mingei Movement and the art of Katazome' An SU(3) variant of instanton homology for webs Building cortical networks: from molecules to function
 

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