Το έργο με τίτλο Unary processing από τον/τους δημιουργό/ούς Poppelbaum, W. J, Dollas Apostolos, O'Toole C., Glickman, Jonathan διατίθεται με την άδεια Creative Commons Αναφορά Δημιουργού 4.0 Διεθνές
Βιβλιογραφική Αναφορά
W. J. Poppelbaum, A. Dollas, J. B. Glickman and C. O'Toole, "Unary processing," Advances Comput., vol. 26, pp. 47-92, 1987. doi:10.1016/S0065-2458(08)60005-4
https://doi.org/10.1016/S0065-2458(08)60005-4
The chapter describes the unary processing. Unary information representation is any representation in which all digits have the same weight. Unary machines can be probabilistic or deterministic, serial or parallel, averaging or non-averaging, synchronous or asynchronous. The chapter reveals that finger counting is the most ancient unary processing method. Since that time, there has been an enormous evolution in counting, number representation, and arithmetic. Finger counting led to the first arithmetic methods, in the form of the production of notches of equal weight. The chapter illustrates the representation of numbers in ancient Egypt, with the number 659 as an example. It determines the radix with the highest theoretical efficiency and compares it to the efficiency of weighted binary. It discusses probabilistic unary methods and deterministic averaging methods, and provides a comparison of characteristics of information processing methods. Further, the architecture and applications of UNIFIELD I are described.