Nice++ Thankyou, I now have the full set.
Except...it can be taken further: R & R & R & R & R & R gives 0.5 bits :)
So, it should be possible to get all 32 n.5 possibilities. And then all n.(25|75) etc.
The ultimate question is this. Given an arbitrary target in the range 0 .. 99.99999999%..., is it possible to programmically generate the sequence required to approximate it?
In reply to Re^4: Boolean math: Fill in the blanks.
by BrowserUk
in thread Boolean math: Fill in the blanks.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |