week 12

This week we are working on the assignment 3. After finishing the question 5, I have a general idea about it.

I am thinking that every function has a character whether its gonna halt or not.

Then I can reduce Halt to every function. Simply, I can just put my function in to Halt.

As a result, a function is not computble is a sequence of halt is not computble. The contrapositive is 'if halt computable then the original function is computable.'

Week 10

I got my second term test back this week, I did OK in this test which I got a 80%s BUT I make few mistakes and I think I should learn something from them.(I will analyze them later in this post). And we get our assignment 2 result back, we r almost getting a full mark but has a terrible mistake that we made a typo on a symbol of the negation of a question so its proof doesn't make any sense....

From those mistakes, 

1) double check the negation

2) pay attention to the symbols in () especially when we try to negate it.

3) when stuck, try the contrapositive.