Turing Machines and the Halting Problem
The study of axiomatic systems culminated in the advent of the Turing machine, one of the earliest mathematical models of computation. Join us as we rigorously explore the foundations of computation theory and one of its greatest hallmarks – the Halting Problem.
In addition to discussing computation models and their history, we shall lay the groundwork for complexity theory and algorithms as well as present the formal statement of the P vs NP problem. This session aims to introduce theoretical computer science to an enthusiastic audience with as few prerequisites as possible.
About the Speaker:
Muhammad Haashir Ismail is a senior student of mathematics at Virtual University with a bachelor’s in computer science from FAST-NUCES Islamabad. His interests include geometry and computational complexity.
This session is free and open to all. Just visit the venue to attend it.
The Black Hole
Plot 5H, Street 100, G-11/3, Islamabad.
Click here for Google Maps Location
