Algorithm 193: reversion of series
Henry E. Fettis · Communications of the ACM · 1963
liEALT[ZI N G BOOLE ~N (20 N N EC I I~ E~ ON TilE LB~i i1620 The liB),:[ lf~2() O,[~)(t 1) performs its addition by automatic table iook*11) to a table stored in core storage.Since the contents ,d ~he table may be changed under prograq~ control, several iweresting and powerful operations may be ,.,i)tained in a simple mariner [! O~e such class of operations is the 16 Boolean connectives of two variat)les.Assume the simplest representation of operand bits--each operand bit is stored as one IBM 1620 digit (extension of the principles discussed here to more dense packing of up t<:) d+ree bits per digit is straightforward).Any of the 16 Boolean connectives .,)ftw<) variables may l)e represented as a four-bit string which gives the trut h table for the connect ive.l"or example, tim connective XOR can be represented by the truth table.Ope,asd