in binary modular maybe but not boolean

I remember something about them being hunted to extinction

and then you get to close all tabs right of the first

2^-2 * (2^-1)-1 = 2^-2 * 2^(-1 * -1) = 2^(-2 + -1 * -1) = 2^(-2 + 1) = 2^-1 = 1/2 = 0.5

imagine tying a knot on the end of the bag, as far from the bread as possible, and just cutting it off and retying every time you want bread

how much is a “feef”