Wednesday, 10 August 2016

Theory of Computation Unit 4 (Turing Machines)

Turing Machines: Introduction, TM model, representation and languages acceptability of TM Design of TM, Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing machine as enumerators. Properties of recursive & recursively enumerable languages, Universal Turing machine.

No comments:

Post a Comment