18CS54 MODULE 5 AUTOMATA THEORY AND COMPUTABILITY VTU NOTES
18CS54 Automata Theory and Computability VTU CBCS Notes Question Papers 18CS54 MODULE 5 AUTOMATA THEORY AND COMPUTABILITY NOTES by VTUnotesallsem.
Decidability:
Definition of an algorithm, decidability, decidable languages, Undecidable languages, halting problem of TM, Post correspondence problem.
Complexity:
Growth rate of functions, the classes of P and NP, Quantum Computation: quantum computers, ChurchTuring thesis.