We have two three digit binary numbers. In one number all digits do invert every single step (does not matter what the initial value was, lets say we have a 000-111).
In another number, each digit inverts on random.
Each inversion requires some work to be done. So for the first number, in 10 steps we require 3*10=30 energy.
If none of the digits in the second number was inverted (this can happen), then in the same 10 steps we require 0*10=0 energy. If all of the digits in the second number was inverted (this also can happen), then we will require 3*10=30 energy.
But since the second number is under randomizer we will usually have less energy spent on it in comparison with the first number.
The question is: what is the average reduction of energy which would be required by the second number in comparison with the first one?
My current train of thought is:
There are four possible cases:
0 inverted - 2^3 combinations
1 inverted - (2^3)^3 combinations
2 inverted - (2^3)^3 combinations
3 inverted - 2^3 combinations
At each step one of those four cases can happen.
So the probability to spend get any single from combination A to combination B is
So on average we supposed to get
Is this correct?
After a second look at all these... I have a feeling that on average, we would have exactly half of the bits inverted. So we can say that if we increase number of bits, on average, the randomized inversion will require half the power than full inversion.
Is this correct or am I oversimplifying it?
That is correct. The random one will on average require half as much energy as the first one.
Here lies the reader who will never open this book. He is forever dead.
Taking a new step, uttering a new word, is what people fear most. ― Fyodor Dostoyevsky, Crime and Punishment