|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 listsMedSoc School of Technology Collective Phenomena group meeting
Other talks“Swamped! The trials and tribulations of tropical peatland science” Mixed effects models with covariates perturbed for SDC Combining statistical disclosure limitation methods to preserve relationships and data-specific constraints in survey data. TBC (SP Workshop) High strain rate deformation response of titanium for aerospace gas turbines Is the NHS financially sustainable?