3 ms·
Typically, binary representations of trinary numbers use a trit that is two bits. So you have four states: -1,0,+1, and uh, something else, which is usually a
by buescher 3y ago
Typically, binary representations of trinary numbers use a trit that is two bits. So you have four states: -1,0,+1, and uh, something else, which is usually a guard bit of some kind or a NaN. Please, please, don't ask me why I know too much about trinary. But one worries about the representation.
It looks like this one stores trits as strings and numbers are then arrays of trit strings.
- Sparkyte 3y agoAgreed, the problem with ternary on a binary level is that it requires twice the bit width to represent it. For example a normal binary element is 0/1 now you need, -1/0/+1, in turn you now need two 0/1 0/1 to represent a ternary which is inefficient. It also means it is incomplete as there will always be a 4th binary placeholder. Putting 3 into 2 is wasteful. I would prefer if we just made some silicon for this.