P506 will cover a good portion of Bools and Jeffrey’s Computability
and Logic.  Various computation machine concepts such as finite state
machines and Turing machines will be covered.  In addition, recursion
theory will be covered leading to Goedel’s famous incompleteness
theorem for systems of logic which are “Suffciently strong.”