Newly Solved Problems of Residue Arithmetic
The basic facts of residue vs. polynomial arithmetic have been known for several years, and many attempts to design residue computers have been made, and a few have even been built. They have not been competitive with polynomial machines because of three basic problems. These were the lack of a fast means of overflow detection, compare, and divide. Solutions seem to be at hand for all of these problems.
I have explained the technical details of those solutions in a series of papers delivered at the IEEE Conference on Circuits, Systems, and Computers at Asilomar.