Paterson's Worms Solved by Number-Crunching
An anonymous reader writes "Thirty years ago, Martin Gardner described Paterson's Worms to the world. Just recently, Benjamin Chaffin, one of the designers of the Pentium 4 chip, managed to trace a couple trillion steps of the 'unsolved' worms, and has pretty much solved all but two of them."
Did somebody say worms?
After reading the article, I'm left scratching my head about what this really means and how it might be useful in every day life.
The obvious answer is that the worms are psychodelic. Those are some "trippy ass worms", as can be concluded from the illustrations in the article. Those worms are on acid.
Skiers and Riders -- http://www.snowjournal.com
Another great background for that monitor that can do 30000x40000.
It's better to vote for what you want and not get it than to vote for what you don't want and get it.
- E. Debs
Brute force is killing thought. We do not learn from randomly testing cases. The scientific method has degraded to the point of oblivion.
Apparently, Frank Herbert was wrong. Brute force is the mind killer, not fear.
There are more pictures at Benjamin Chaffin's page.
There is more information on the games and rules at Sven's page, that includes a comparison of Chaffin's notation to Gardner's and a comparison of Worms to the Game of Life.
The sky is green, the grass is blue.
I devoured his columns as a boy. His simple, clear writing style made it easy to understand very sophisticated concepts. Today, I aspire to write like he did.
He is getting on in years and it's been awhile since I've seen anything new from him (either on math or junk science, his other favorite topic). His collection, The Night is Large is a great overview of his work.
Anway, it's a pleasure just to see his name and know that people are still pursuing the topics he wrote about.
-- Brian
The most rabid believers in American Exceptionalism are the exact same people whose policies are destroying it.
Strange Idea, but, what about using this in encryption for pseudo-random number generation?
It's obviously simple to implement, but requires exponential processor/mem usage to generate each successive generation of pattern's. Would this be effective? would the reduced keyspace be better or worse than the computational requirements?
#!/bin/csh cat $0