Well for now it is just a placeholder placeholder symbol and this is my interpretation.

We were asked to use something along the lines of “Degaussing” to represent numbers in a binary form, this can be difficult and expensive. In my opinion, it’s a more elegant way of putting numbers into a format that the human brain is comfortable with.

How about 0:Degauss

What’s the problem with 0:Degauss? First of all, I’m not entirely sure which way you would do it. In an ideal world 0:Degauss would work for everything. But for the sake of this blog post, I’ll be using it for small numbers which will eventually need to be multiplied or divided, but will still stay in our current system.

First of all we need to create an intermediate representation of 0.0.0. A 0.0.0.0 can be represented in binary as 0x0000001 (as a Hexadecimal string on top of 0x0000001). A Binary number can also be represented through a hexadecimal number, which we can call a (0x001) digit.

So first lets get those integers that are currently on the stack, then start with our digits…

1, 2, 3, 4, 5, 6, 9, 10, 11, 12

…and make a copy of the integer on top of the stack and push it to 0.0.0

1.0.0 (Stack Stack 0 )

0.0.0 (Stack Stack 1 )

0.0.0.0 (Stack Stack 2 )

0.0.0.0.0 (Stack Stack 3)

…and finally push that 0.0.0.0 number to the top of the stack.

1 0 0.0.0.0

Now, on to the magic. Let’s do 0:Degaussing:

Degaussing with a 1

So far 0.0.0 is now on the stack. Let’s now try a different approach to represent those numbers. Here, 0 is placed outside the stack. The 0.0.0.0 number is now on the stack, but now only a 1 is placed over it.

0 0 0

0 0 0

In another approach we’ll also try a number without a 1 on top of it.

nikola tesla free energy secret workshop, calculate free energy change from equilibrium constant, gibbs free energy equation solving for ksp, nikola tesla free energy technology repressed memory meaning, tesla free energy devices