CHEAP ANSWER: If it outputs a true random number, such as some quantum processes appear to. A turing machine cannot do this, you need a probabilistic turing machine for this. (A probabilistic turing machine is not considered more powerful than a normal turing machine with regard to computability by computer scientists because it accepts the same languages, but you asked about "computing a function", which is maybe a slightly different question...)
REAL ANSWER: You cannot, because our ability to observe the universe is limited and you cannot fully observe what any system in nature is doing. If there is a process that appears to be computable, we cannot rule out the possibility that on scales finer than we can currently observe there are fluctuations that are based on something uncomputable. If there is a process that appears to be uncomputable, it might actually turn out that if we had a more complete description of the laws of nature it would turn out to be doing something simpler and computable behind the scenes. (Even the random numbers apparently generated by quantum processes might be based on a deterministic process we cannot see the machinery for.)