I am in the process of reviewing
What can be computed: A Practical Guide to the Theory of Computation
by John MacCormick
and I need YOUR help for the first SENTENCE. I began by saying
This is a text book for a course on Formal Language Theory
but then I realized that this is not what we call the course at UMCP. Then I got to thinking: what do other schools call it? I have the following so far:
UMCP: Elementary Theory of Computation
Harvard: Introduction to Theory of Computation
MIT: Automata, Computability, and, Complexity
Clark: Automata Theory
(My spellcheck does not think Automata is a word. Also Computability. Usually I listen to my spellcheckers, but I checked and YES, I spelled them right.)
For some other schools I either hit a place I needed an account, or I just got titles without a description so I could not be sure.
This is where YOU come in!
Please leave comments with your school and the title of the course at your school that covers a reasonable overlap with: Regular Sets, Context Free Sets, Decidable and Undecidble and r.e. sets, P, NP, perhaps other complexity classes, and NP-completeness. Its FINE if your answer is one of the above ones, or one of the other comments--- I plan to later set this up as a pigeonhole principle problem.
I suspect that courses in algorithms are called Algorithms or Introduction to Algorithms.
I suspect that courses in cryptography are called Cryptography or Intro to Cryptography.
Why does the non-algorithm, non-crypto theory course have more names?