User blog comment:Superraptor1234/Pyloplex/@comment-30754445-20170702200124/@comment-25810596-20170702222208

Yay! I think you might be right (?).

So in the fourth paragraph, I'm thinking about our computer having a certain number of "bits" which can only be 0 or 1 (I mean they could be theoretically anything, like an n-state Turing machine), but essentially let's say we set one bit a value of 1, but we say in the program that this represents 10^10^100 in a variable.

So then we set every value to 1 in the entire computer, i.e. 1... (n times) ... 1 or 10^10^100 ... (n times) ... 10^10^100. But then we say that this value is now equal to 1 and set the universe up again as 1 = 10^10^100  ... (n times) ... 10^10^100. Recursively this is done (written as a program) and then this program is compressed as much as possible (the Kolmogorov complexity, which is uncomputable by definition, but does exist). This is the value I set as equal to dingir.