csc165 Dec 2nd.2014 halt

in the lecture , we learnt the halt and countable and computable.
a computable function is a well-defined function, a well- defined function is a 1-1 and onto  function .
hat(f,n)is a non-computable function.
using diagonalization , implement halt function with a function that we want to prove that is un-computable.