If K$($x$)$ is computable, then TM M can be constructed which on input n computes K$($x$)$ of all strings x of length n and outputs the first incompressible string it finds.