On Wed, May 02, 2001 at 11:09:45AM -0500, Scott G. Miller wrote:
> On Wed, May 02, 2001 at 07:46:21AM -0400, Travis Bemann wrote:
> > On Wed, May 02, 2001 at 12:19:48AM -0500, Scott G. Miller wrote:
> > > >
> > > > Now you just need to suggest a puzzle which is machine generatable, not
> > > > machine solvable, and not too obnoxious.
> > >
> > > Heres one idea, but I dont think it generates enough information for a
> > > key. I define "enough information" to be greater than 2^32 choices for
> > > someone to do a brute force insertion to cover all the possibilities
> > > mechanically.
> > >
> > > Easy: Generate an image that contains a polygon formed from sparse,
> > > non-connected dots more densly packed where the letter is. Make it
> > > significantly random. Machine vision programs will suck at this, neural
> > > nets can do it but they have to be fairly large and will be slow.
> > > Then present a 4 x 4 tile of line drawings. Ask the user to pick which
> > > one looks like the dotgram.
> >
> > I can already think of how to have a computer defeat this. If you are
> > just using this problem, it would not be hard at all to make a
> > specialized program for getting past this.
> Wow. If you can solve a dotgram with a computer program, I can refer you
> to a half dozen computer scientists working on machine vision that would
> *love* to hear about it.
I thing I might have misinterpreted what you meant. I thought you
meant recognize an arbitrary polygon composed of an area of more
densely packed dots on a background of less densely packed dots. It
would probably not be incredibly hard to write a program to handle
just this and only this problem (NOT general vision and image
recognition). Writing a program that would do general image pattern
recognition would be MUCH harder IMHO.
--
Yes, I know my enemies.
They're the teachers who tell me to fight me.
Compromise, conformity, assimilation, submission, ignorance,
hypocrisy, brutality, the elite.
All of which are American dreams.
- Rage Against The Machine
PGP signature
