Setun ternary computer documented by Moscow State University team
Exploring the history of ternary computing beginning with the 1958 Soviet Setun machine, the article examines how balanced ternary arithmetic—using minus one, zero, and plus one—has re-emerged to optimize large language models like BitNet and PrismML's Ternary Bonsai. The author details how ternary weights eliminate multiplication steps in inner loops to deliver significant memory and speed improvements. Additionally, the piece surveys related hardware developments, including experimental four-state switches. Open article →