About this document
Introduction to Computation Theory by Ravindra Joshi is a document available to read on EtoBox.
This document provides an introduction to the theory of computation, including models of computation like Turing machines and complexity classes like P, NP, NP-hard, and NP-complete. It discusses the Church-Turing thesis and halting problem. It proves the halting problem is undecidable by constructing a paradox where a program H is given as input to itself, leading to a contradiction whether it halts or not.
- Author
- Ravindra Joshi
- Language
- EN