I just looked back at post #8, which shows a little more of what the OP has in mind. The question is not really about finding "the" expression that yields a given number, as was stated, but about associating each number up to, say, 10^15, with some expression for the number, which he expects to be less than 8 symbols (half as many), in order to arrive at lossless compression. If that had been stated in the original question, some of what has been said here would not have been said. The OP's context was misrepresented, so we are talking past one another.
Claiming that an expression longer than the number it represents is not an expression, however, is silly. We need to define our terms before we use them in an argument.
I don't want to use the word "stupid", which does not produce useful communications, but we do need to ask the OP to face reality. Think about what is being assumed here without any attempt at proof. Why should we think that every number can be calculated by an expression with half as many symbols as the number itself? This turns out to be self-refuting.
Suppose that an "expression", whatever definition we give for that, consists of some combination of 10 digits, 10 operations, 26 letters (used for function names, say). Then 7 such symbols can form (10+10+26)^7 = 435,817,657,216 distinct strings; that's about 4*10^11, which is far less than 10^15, so we can't represent every number. And I've been very generous here in allowing any word at all as a function. Consider that many of these strings will be meaningless (not expressions at all), and many will produce duplicate numbers. The claim is nonsense.
By the way, I finally looked up Sloot to see what the background of the question is, and everything fits together. This is a fantasy question, and we should drop it.