In-depth knowledge of turing machines, countability, languages, the Church Turing thesis, universality, undecidability, P and NP, NP-completeness, and NP-complete problems required. Also must be able to work for a constant 3 hour period non-stop. A sample exam with answers is attached and I have another sample exam I could send. The questions will be very similar to those in the sample exams. Please only bid if you can complete these questions within a couple of hours efficiently. Webcam preferred.