User blog comment:Qq1010903229/My C Function/@comment-43798125-20191028105031/@comment-35470197-20191102005349

> if you could implement an oracle module in a coding language (for that coding language), that kind of function immediately becomes illdefined for large enough input

Are you talking about the maximum return value of possible C programs except for allowing the first order oracle with at most n characters? It is well-defined as long as we fix a way to code such computation model, because the halting problem of a first order oracle Turing machine is undecidable by a first order Turing machine. Or don't you know the higher order busy beaver functions?