Given a Turing machine T, determine whether it ever halts on any input.
Given two Turing machines T1 and T2, determine whether they solve the same problem
Given a formal logical statement about algebra, determine whether it is a theorem or not
A variety of puzzles that involve tiling the plane.
CS1104 Main Page
Last Updated 01/05/2000
© L.Heath, 2000