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?
Sounds painful...
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
john conmway, the other name in the opening, I believe was the inventor of life.
every day http://en.wikipedia.org/wiki/Special:Random
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.
This isn't much of a solution, in particular he can only say that some worms "appear infinite" and he couldn't prove that two worms were identical except for being rotated by 180 degrees. While his programs would be useful to an individual studying the worms to try form conjectures regarding symmetry and halting they should not be confused with real solutions. Understanding should be the first aspect to any solution.
The brute force solving of problems can be very useful. The scientific method relies on theories, and having ample data to look at helps people understand complex systems, sparking the intuition that leads to more theories, and hopefully, more elegant solutions. I've worked on the optimization of large systems, and nothing helped me understand the processes involved as much as "brute force" simulations.
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.
from the article Currently my grid is about 1.57 million points on a side
If he's saying that the 2 worms hit the end of the 1.57million^2 grid, in a non-repeating pattern, that's pretty neato. We must know where it ends! Put it on Big Mac, make the grid bigger, and call it iWorms.
Brute force is taking all the possible combinations (e.g. all the base pair combinations in DNA) and test them *once*.
Evolution takes a small sample (the current instances of gene combinations, i.e. the current generation) and creates another small pool (the next generation) depending on a selection algorithm (survival of the fittest). Most combinations are never ever tested.
And unlike a traditional brute force approach, the same gene combination may be tested many times (in theory at least), and the selection is not deterministic (that is, the "best" individual can e.g. die by chance).
Another thing, brute force may only find the best selection if there is one such combination of genes. Contrary to that, it is likely that there'll be specializations in the gene pool (e.g. at some point, many species specialized into male and female forms, some into worker/queen etc.)
Kjella (have moderated thread, so ACing)
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
Oh great, another worm? Where do I get the patch from this time?
Evolution is not brute-force. Evolution is a learning method in that each new generation is based on the results of the previous generation.
Your nucleic DNA contains approx 3*10^9 bases. That's 4^(3 billion) permutations. Just how long do you think it would take if you worked through AAAA...AAAA , AAAA...AAAT etc. before you came up with something as workable as the human genome? Same deal with a random walk.