|
|
|
A. Preliminaries 1. Sets, Relations, Graphs 2. Induction and Recursion 3. Formal Systems B. Logic 1. Boolean Algebra and Switching Theory 2. Computer Logic Networks 3. Propositional Calculus 4. Predicate Calculus C. Machines and Grammars 1. Finite State Machines and Regular Expressions 2. Context Free Grammars 3. Turing Machines 4. Production Systems D. Computability and Complexity 1. Unsolvability 2. Intro to Algorithmic Complexity 3. Program Verification
The Components of the Course are in no particular order.
|
|
|
Last modified 22/May/97