The theory of computation explores the mathematical foundations of computer hardware and software, focusing on what can and cannot be computed, and the efficiency of computations. It is divided into three main areas: automata, computability, and complexity, each addressing different aspects of computational problems and their classifications. The course aims to provide insights into the methodologies for understanding computational models and the nature of solvable versus unsolvable problems.

1. Theory of Computation
References:
1. Introduction to the Theory of computation:
Michael Sipser
2. Theory of computer Science: K.L.P Mishra,
N. Chandrasekaran
Course Teacher : Prof Dr. Md. Monzur Morshed

2. Introduction
Theory of Computation comprises the
fundamental mathematical properties of
computer hardware, software, and certain
applications thereof.
The objective of this course is to determine
what can and cannot be computed, how
quickly, with how much memory, and on
which type of computational model?

3. Central areas of the theory of
computation
Three areas
• Automata
• Computability
• Complexity

4. Complexity
Computer problems come in different
varieties; some are easy (ex: sorting), and
some are hard (ex: scheduling).
In complexity theory, the objective is to
classify problems as easy ones and
hard ones.
One achievement of complexity theory is,
researchers have discovered an elegant
scheme for classifying problems according
to their computational difficulty.

5. Computability
Certain basic problems cannot be solved by
computer.
In computability theory the classification
of problems is by those that are
solvable and those that are not.
Computability theory introduces several of
the concepts used in complexity theory.

6. Automata
Automata theory deals with the definitions
and properties of mathematical models of
computation.
These models play a role in several applied
areas of computer science.
One model, called the finite automation, is
used in text processing, compiler, and
hardware design.

7. Another model, called the context-free
grammar, is used in programming
language and artificial intelligence.