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.'