COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
HypercomputationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Matthew Ireland. The Church-Turing thesis states that a function is computable by “reasonable means” if and only if it is computable by a Turing machine. In this talk, we examine computation that is not computable by reasonable means, and is therefore not computable by a Turing machine. Several theoretical hypermachines will be introduced including Turing’s Oracle machines and so-called Zeno machines. We’ll discuss how these machines can “compute the uncomputable”, and discuss the issues with physically implementing such machines. We conclude that it is still unclear whether hypercomputation is possible within our universe, with the answer having serious implications for mathematics, physics, and philosophy. This talk is part of the Churchill CompSci Talks series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsEngineering - Mechanics and Materials Seminar Series Wolfson College Lunchtime Seminar Series - Wednesdays of Full Term Biomimetic manufacturing and sustainabilityOther talksQuantifying conscious states by means of self-initiated brain activity Simpson's question: How does behaviour determine evolution? Extension of Eigenvector-based Acoustic Propagation Methods to Real Aeroengine Duct Geometries Expanding Precision Medicine along Clinical Pathways with AI Powered Decision -Support Mechanisms of forgetting |