All good things come to an end, including csc165. In our
last couple of lectures, we wrapped up with countability and induction. The two
topics were very contrasting in terms of difficulty. Having learned in high
school and mat137, induction is no foreign idea for me. However, I find the
countability and computability sections very abstract. I had trouble
understanding in class the concept of diagonalization, knowing only that it
shows how there are programs that are incomputable. Going through the tables
and lecture notes one more time on my own, I finally realized what Danny meant
when he said there is always at least one result that is different in
diagonalization. Knowing that computability and induction will not be in the
exam is a relief. Yay for slightly less material to study.
No comments:
Post a Comment