About

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.