作者:
Apache (阿帕契)
2018-06-22 11:17:29課程概述與目標：
Provide characterizations (computational models) of the class of effective
procedures/algorithms.
Study the boundaries between complete (or so it seems) and incomplete models
of
computation.
Study the properties of classes of solvable and unsolvable problems.
Solve or prove unsolvable open problems.
Determine reducibility and equivalence relations among unsolvable problems.
Apply results to various other areas of CS.
教科書：
An Introduction to Formal Languages and Automata, 6th Edition 2016, Jones &
Bartlett
Learning by Peter Linz
學期作業、考試、評量：
Homework: 40%
Midterm Exam: 25%
Final Exam: 35%