This week we have problems without algorithms and contradictory
program. There is less content than before because of the fall break. This week’s
content is a litter confusing for me; I understand some of it, but there are
also some parts that I am not sure. For example, the uncomputable function
sounds reasonable and I understand it, but I don’t feel like I can master it
right now.
Meanwhile, I start to work on assignment 2 since assignment always takes a long time to think. For the last question in the assignment, I don’t really know how to it because it is a new type of question to me, but it says I should emulate the technique from the course notes. Also, the proof that involves limits is new to me, I am not sure on how to use n and B in those question. So I decide to read the course note in this weekend in order to have a better understanding of those questions.
As the term approaching to its end, it’s time to begin reviewing, though there is still lots of work from different subject to do.
I just found out Celina posted some examples from lecture with her own explanation in her slog which helps me understand computability better.
http://celinasopiniononcsc165.blogspot.ca/2014/12/week-11-halt-computability-and-many.html?showComment=1417581487045#c3131525499275371659
Meanwhile, I start to work on assignment 2 since assignment always takes a long time to think. For the last question in the assignment, I don’t really know how to it because it is a new type of question to me, but it says I should emulate the technique from the course notes. Also, the proof that involves limits is new to me, I am not sure on how to use n and B in those question. So I decide to read the course note in this weekend in order to have a better understanding of those questions.
As the term approaching to its end, it’s time to begin reviewing, though there is still lots of work from different subject to do.
I just found out Celina posted some examples from lecture with her own explanation in her slog which helps me understand computability better.
http://celinasopiniononcsc165.blogspot.ca/2014/12/week-11-halt-computability-and-many.html?showComment=1417581487045#c3131525499275371659
The computable thing is confusing! It is hard to proving something does not exist by pretending it exists and work on it. I think it is going to take some time to digest like things used to be.
ReplyDelete