CENG565Graduate
Introduction to Theory of Computation
Printed in the catalogue as INTRODUCTION TO THEORY OF COMPUTATION
Course content
Turing machines. Church-Turing thesis. Decidability. Reducibility and Recursion Theorem. Complexity theory: Classes P and NP, NP-Completeness. Space Complexity. Intractability.
More in CENG
- CENG100Computer Engineering Orientation
- CENG111Introduction to Computer Eng. Concepts
- CENG140C Programming
- CENG213Data Structures
- CENG222Statistical Methods for Computer Engineering
- CENG223Discrete Computational Structures
- CENG232Logic Design
- CENG240Programming with Python for Engineers