Understanding Turing, Computability & the Halting Problem 🧠

HBP Curriculum: Interdisciplinary Brain Science | ICT for non-specialists | 4th Teaching Cycle

Lecture 3: Turing, computability, halting problem
Speaker: David Lester, The University of Manchester, UK

There are limits to what it is possible to compute, an issue first addressed by Alan Turing in 1936, just before the first real computers became available.
We will discuss what it means for a problem to have a computable solution, methods for combining computability results to analyse more complicated problems, and finally look in detail at one particular problem which has no computable solution: the halting problem.

Visit our HBP Curriculum: Interdisciplinary Brain Science website: https://www.humanbrainproject.eu/en/education/participatecollaborate/curriculum/
Discuss with us, the lecturer or other participants in our forum: https://forum.humanbrainproject.eu/t/hbp-curriculum-online-course-ict-for-non-specialists/285

Contact: curriculum.edu@humanbrainproject.eu

Twitter: @HBP_Education
Facebook: @hbpeducation