Let $f$ be the function that maps the godel number of each proposition P in PA to 0 if P is provable false and 1 if P is provable true and 2 if P is independent of PA.
Then $f$ is not computable. Is it possible to prove that for every computable function $g$, $g\neq f$ ?
How, or - which known result does it follow from?