From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_MSGID, SUBJ_ALL_CAPS autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 111d6b,3aad2600dfe8f337 X-Google-Attributes: gid111d6b,public X-Google-Thread: 109fba,3aad2600dfe8f337 X-Google-Attributes: gid109fba,public X-Google-Thread: f753e,3aad2600dfe8f337 X-Google-Attributes: gidf753e,public X-Google-Thread: fef06,3aad2600dfe8f337 X-Google-Attributes: gidfef06,public X-Google-Thread: 1108a1,3aad2600dfe8f337 X-Google-Attributes: gid1108a1,public X-Google-Thread: 10b276,3aad2600dfe8f337 X-Google-Attributes: gid10b276,public X-Google-Thread: 1014db,3aad2600dfe8f337 X-Google-Attributes: gid1014db,public X-Google-Thread: 103376,3aad2600dfe8f337 X-Google-Attributes: gid103376,public From: "Alf P. Steinbach" Subject: Re: WHERE ARE ALL THE OT EXPERTS??? Date: 1996/07/25 Message-ID: <31F70013.7F13@online.no>#1/1 X-Deja-AN: 170105750 references: <4t6hk2$cek@chinx10.thoughtport.net> <31F6FC7E.7179@interaccess.com> content-type: text/plain; charset=us-ascii organization: Telenor Online mime-version: 1.0 newsgroups: comp.object,comp.object.corba,comp.object.logic,comp.lang.ada,comp.lang.c++,comp.lang.c,comp.lang.c++.leda,comp.lang.java.misc,comp.lang.javascript,comp.lang.objective-c,comp.lang.smalltalk,comp.programming,comp.lang.java x-mailer: Mozilla 2.0 (Win95; I) Date: 1996-07-25T00:00:00+00:00 List-Id: Thaddeus L. Olczyk wrote: > > bbum@friday.com wrote: > > BTW: CRC has classically been known as a Cyclic-Redundancy Check. A > > very simple algorithm for validating data... If someone recycled it into an > > OT term, then someone is coming from a point of ignorance (its not like CRC > > related technologies are either obsolete or uncommon). > Yes, but CRC also stands for class-responsibility-collaborator. > I also wouldn't call CRC a simple algorithm as it is defined > as the remainder of a Z(2) polynomial (the string to be hashed ) mod > a fixed prime Z(2) polynomial. This is reminiscent of ObjectMagazine, a trash publication I unfortunately thought looked interesting enough to buy. First, CRC *is* a simple algorithm -- there's nothing complicated in modulo division (I remember we had to implement the CRC algorithm as one of our assignments in a fundamental programming course back in 1982 or thereabouts). Second, I believe only managers are interested in "Class-Responsibility-Collaborator" cards -- fancy acronym, which they can impress other (low-level) managers with, but (1) it's so trivial as to be completely useless, and (2) it's *worse* than useless because it's a completely action-centered approach. Urgh. - Alf