Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Moderate Bean Counting

Author: Dann Corbit

Date: 10:06:05 07/01/00

Go up one level in this thread


Troll posts typically have very high read counts.

I know you're tongue-in-cheek on this one, so I will propose an alternative.

We will create a checksum function which consumes the letters of a post and
emits a hash value.  We will calibrate it with 100 true posts, and one hundred
false ones.  Then we will reject all false posts that arrive.

We will also write a topicality hash function and calibrate it.  Then any
arriving posts that do not emit a "topical" checksum can be automatically
rejected.

How's that for a staw man?



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.