This is beautiful. I will respond to one specific thought --- the claimed target of math being omnipotence.
To set the conceptual stage for my response, let me first appeal briefly to some notes.
Question: How do you quantify randomness or "patternness"? One of my favorite proposals is the concept of Kolmogorov complexity, which quantifies the randomness of strings relative to a computer.
Informally, the Kolmogorov complexity K(x) for a string x is equal to the length of the shortest computer program that can output x. So, what does this mean?
Consider the ζ (which is just “10” repeated 50 times):
ζ: 1010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010
This string is 100 characters long. But its Kolmogorov complexity, K(ζ), seems to be less than 100. Why? Because you could (in a given language) program ζ in less than 100 characters. I essentially just did; in pseudocode, it would be something like:
print(“10” * 50)
This program, despite being shorter than ζ itself, would output the string correctly. So you get the idea: the Kolmogorov complexity of an object in effect reflects how long it takes to be described (though the specific measure varies across different languages and computers, the idea is consistent across).
The basic thing to note is this: there is a sense in which ζ seems not to be random; intuitively, it is the fact that it has a pattern. And it is this pattern—repeating “10”—that enables us to describe ζ in a compressed way (that is, using a program that takes less characters than the string itself). Kolmogorov complexity is meant to formalize this intuition — that fundamentally, patterns enable compressibility, and randomness is incompressibility.
So, Kolmogorov complexity (or algorithmic information) captures the intuition of patterns being dual to randomness, which is neat. That said, it's not generally computable, and there are some technical things needed to make it work formally (e.g. the idea of prefix-free Kolmogorov complexity).
Now, how does algorithmic information relate to the question of math's potential for omnipotence?
Informally, I generally think of math as follows: "the methods of compression, universal across effective compressers, in the limit of data."
So, what is an "effective compresser"? Roughly, imagine there is an algorithm that receives datapoints (in the "real world", think sense-experience), and then performs some kind of "operation" to encode them. There is time to try different schemes. Loose example: a scientist who is reasonably intelligent. The scientist observes the world. He seeks a "theory" to understand these datapoints, and he has his lifetime to do so. His basic goal is to find "programs" for compression that allow him to parsimoniously "recreate" these datapoints, which in turn, helps him to predict them (assuming his methods of compression identify true "hidden causes", and ignoring the problem of induction).
Eventually the scientist will arrive on certain programs for compression. Maybe he'll find numbers. In fact, with enough time, he is sure to discover "something like" numbers. So perhaps there are indeed methods of compression that are universal or "inevitable" for effective compressers with enough datapoints. This is what I imagine math aspires to.
For example, maybe addition is one of those universal methods of compression. What I'm saying here is that if you're trying to compress datapoints, and you have enough datapoints, eventually "something like" addition (up to isomorphism?) will be strictly useful to encode. Maybe. And, so any compresser that's good enough and has datapoints, will do so. That is to say, perhaps any scientist that is sufficiently advanced and has enough time / data, will eventually discover addition.
Quantity, length, etc. these things strike me as being potential "universals" in this above sense.
But then...
Are there such universals? Does this concept even make sense?
A problem is that Kolmogorov complexity is computer/language dependent. You can force it to be a universal computer, sure. But the reality is that relative to any computer, even a universal one, the vast majority of strings are random (I can prove this fact quite easily, if you'd like -- the basic idea is that if you define "not random" as "described with a short program", you run into the problem that there are many more long strings than short strings, so short inputs can cover only a small part of the terrain) then there is always a computer to which those "random" strings aren't random.
The extent to which patterns or randomness are necessarily observer dependent is a genuine facet of math being limited. Even in the formal world, compression is limited.
Further yet, there is a deeper point, which perhaps is related to what you are getting at. The point is this: it is not just the question of whether "datapoints" (left undefined) are patterned (compressible) or not, BUT the fact that it is a kind of fluid act or "process" of actively receiving datapoints, being affected by them, making sense of them, etc. that is itself a totally different thing. You can never "complete" this task.
You don't get anything whatsoever about firsthand experience from "universals"; in fact, firsthand experience might be described as "that which is not universal".
A scientist who observes the world and discovers some beautiful pattern or order; this is a beautiful thing. Is there any way to "compress" this experience? Maybe not. Some things are defined by their limitations. Can anything be defined from the outside? For that matter, can anything be defined from the inside?
Fixing things in formal terms delimits those things, but delimit the world it does not.
I am still in synthesis mode, but these are the sparks that were struck for me. Hopefully some are enjoyable.