exactly why I'm learning AWK via the gray book
https://phys.org/news/2008-02-physicists-qubit-qutrit-entang...
* You can negate a number by interchanging 1 and ̅1.
* The sign of a number is given by its most significant non-zero trit.
* Rounding to nearest integer is the same as truncation.
By the way if we had balanced ternary computers today, then you wouldn't have programming languages with signed and unsigned integers. They'd be the same thing.
Of course the above might be academic if it's more difficult to implement in CMOS ...
Edit: Also you can argue that the most economical radix is e, and 3 is closest to this ideal. See: https://web.williams.edu/Mathematics/sjmiller/public_html/10...
Edit #2: Removed the claim that addition is easier than binary. I misread what Knuth was trying to say.
I'm skeptical of value of ternary. The key behind the success of binary computers is that binary has great noise immunity; having a _single_ threshold is way simpler to get working than two or more. (Yet we do go there for NAND Flash, but note how speed and endurance worsen dramatically as thresholds are added).
The "most economical radix" is often cited but it's a red herring - it ignores practical concern of greater importance.
https://dev.to/buntine/the-balanced-ternary-machines-of-sovi...
Programming with trits and trytes!
Unfortunately, domestic Soviet computers were effectively killed by a 1970 decision to base all future efforts on a "Unified System" which was really a clone of IBM System/360: https://en.wikipedia.org/wiki/ES_EVM
Playing it safe by shooting yourself in the head...