Ternary Computer - Balanced Ternary

Balanced Ternary

Ternary computing is commonly implemented in terms of balanced ternary, which uses the three digits −1, 0, and +1. The negative value of any balanced ternary digit can be obtained by replacing every + with a − and vice versa. It is easy to subtract a number by inverting the + and − digits and then using normal addition. Balanced ternary can express negative values as easily as positive ones, without the need for a leading negative sign as with decimal numbers. These advantages make some calculations more efficient in ternary than binary.

I often reflect that had the Ternary instead of the binary Notation been adopted in the Infancy of Society, machines something like the present would long ere this have been common, as the transition from mental to mechanical calculation would have been so very obvious and simple. (Fowler, 1840)