This week in lecture we discussed computability and induction, which both will not be on the exam, but will probably be useful in the future. However we have already done a lot of induction in MAT137, and the introduction in CSC165 was not very beneficial compared to what I have already done. The computability portion of the lecture was interesting and lends what feels like a glance into the future. However the lecture confused me more than any other thing in the course. I don't really understand how the halting function can relate to a function, and how one would be a helper function for another. In this slog, someone did a great job of identifying very similar issues to mine, surrounding this topic: http://slogcsc165.blogspot.ca/. I have watched a few youtube videos and reviewed the course notes. I think I understand how to solve computability problems, but I still do not understand how, or why it works.
This was the last week of class, and although we didn't cover too much important information regarding the upcoming exam; the lecture gave us an idea of what the future holds, and how our courses will be. I feel like I am ready for the upcoming exam, as long as I take my time, and don't skip out on any steps.
