Author: Hemant Kushwaha
Assistant Professor, Department of Computer Science & Engineering
Haridwar University, Roorkee, India
This work is archived on Zenodo and assigned a DOI:
https://doi.org/10.5281/zenodo.18995206
This repository contains academic notes explaining the concept of computability in theoretical computer science.
Topics covered include:
- Computability of Algorithms
- Computable vs Non-computable Problems
- The Halting Problem
- Turing Machine Model
- Decidable and Undecidable Problems
- Difference between Computability and Complexity
These notes are designed for undergraduate and postgraduate students studying Theory of Computation and algorithms.
Computability theory forms the foundation of several areas including:
- Artificial Intelligence
- Cybersecurity
- Software Verification
- Formal Logic
Creative Commons CC-BY