|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 listsIoA Stellar Pops Histories of Education and Childhood Wolfson Press Fellowship
Other talksRe-building the diseased retina with stem cells Evolution of Cell-Cell Adhesion, and New Insight into Mechanisms in Animals 2D or not 2D? Two-dimensional nanostructures for sensing and solar energy conversion Under pressure: Environmental stressors alter relationships between physiology and behaviour in fishes Syringomyelia in Cavalier King Charles Spaniels Professor Junying Yuan, Harvard Medical School (Cellular Medicine Series) on 'Regulated cell death: from apoptosis to necroptosis' Host: David Rubinsztein