His point is probably along the lines of "any machine emulating a Turing machine can compute all computable functions." Which of course doesn't mean that there aren't uncomputable functions.