On top of theoretically computable, but highly divergent / unstable functions mentioned nearby, there are fully deterministic (non-random, pure) but non-computable functions. The simplest example is a function that answers whether a given Turing machine would stop.