(See the reviews for the previous tests)

Turing machines (TM) and related machines
Definition of Turing Machine (input alph., tape & head & alph.,
states, START & HALT, program [edges=(read,write,move-tape)]);
deterministic (may have missing edges but no duplicate read)
Post machine (PM), diff. from TM; equivalence, convert PM to TM,
TM to PM (representing tape and head position with queue)
2PDAs (2stacks + deterministic), Minsky's Theorem, nPDAs
Move-in-State, Stay-option, {nL-nR}, k-Track, and full tape TMs
Nondeterministic TMs (NTM); equivalence; Mother's advice;
CFL acceptors

Recursively enumerable and recursive languages
Definitions (based on ACCEPT(T), REJECT(T), and LOOP(T) for some TM)
Complement of recursive is recursive; L & L' r.e. --> recurs.
Union of r.e.'s is r.e.; non-r.e. language by encoded TM; UTM;
Complement of r.e. may not be r.e.; r.e. may not be recursive:
encoding TMs; languages ALAN and MATHISON;
Chomsky hierarchy; phrase-structured grammars, type 0 grammars;
TM=PSG as language acceptors or equiv. to r.e.;
r.e. operations (union, intersection, Kleene star, product/concat) & proofs

Computers and computability
computation on TMs (+, -, *, MAX, select, SQRT), computability
Church's thesis; the Halting Problem for TMs (unsolvable) 
Language generators, equivalence with acceptance, size-order for recursive