Assignment 3, Computability and Final Exam

So the past few weeks can be summed up by assignment 3.  Big-Oh proofs, limit proofs and computability.  Reductions have been a little tricky to figure out but going to office hours has been really helpful.  I’ve found that reductions remind me a bit of the recursion we did in CSC148, in that you write a function’s docstring and then assume the function does as it says.  In CSC148, this is what makes recursion work and in this course the assumption is what leads to a contradiction.

Looking forward, the final exam is the only thing left.  I feel like the assignment 3 gave me a good review of the past few weeks material.  Good luck for the final!