Skip to main content
CSC-601
BS

Theory of Computation

(DE) Domain Elective Theory: 3 Cr. Hrs Total: 3 Cr. Hrs
Models of computations: partial recursive functions, Turing machines, alternative models of computing. Chomsky hierarchy of languages, Basic theory and limitations of computability. reducibility & decidability Un-decidability. primitive & recursive functions and Resource-bounded computational complexity, non-determinism, P, NP, NP-complete classes.
In Programmes
MPhil MPhil (Computer Science)
Electives Pool — Elective (Current Scheme)
Back to Course Catalog