Leebra
login register
That post seems to be missing.
load all comments
charizardcharz 11 points 2 years ago

Why not wait for a random bit flip to increment it?

int i = 0;
while (i != i + 1);
//i is now incremented

save

path: 0 14334293, hotness: undefined, score: 11, children: 3
AcesFullOfKings 6 points 2 years ago

save

path: 0 14334293 14334485, hotness: undefined, score: 6, children: 2
psud 1 point 2 years ago

You just wait for the right bit too be flipped and the wrong ones flipped are flipped an even number of times

save

path: 0 14334293 14334485 14340927, hotness: undefined, score: 1, children: 0
charizardcharz 1 point 2 years ago

I didn't really dig too deep into it. It might be interesting to see what it actually compiles to.

From what I can remember result of i+1 would have to be stored before it can be compared thus it would be possible for i to experience a bit flip after the result of i+1 is stored.

save

path: 0 14334293 14334485 14334839, hotness: undefined, score: 1, children: 0

thanks for using Leebra!

go to feed...