On 9/20/2012 8:17 PM, Stephen P. King wrote:
On 9/20/2012 9:50 PM, meekerdb wrote:
On 9/20/2012 6:25 PM, Stephen P. King wrote:
On 9/20/2012 12:09 PM, meekerdb wrote:
On 9/20/2012 12:22 AM, Stephen P. King wrote:
Any one up to explaining this:
What's to explain? The bees found the shortest route. Do you suffer from the
misconception that NP-hard = insoluble? NP is just a description of how a
computation scales. For the number of places bees visit it may be very easy to
solve, even though the number of steps grows faster than polynomially with the number
of places to visit.
Leave it to you to miss the obvious. How did the computation occur for the bees?
What the researches showed is that bees can figure out the solution and navigate it as
they go from flower to flower. How does this happen?
I didn't miss the obvious way to find out, which was to read the paper. They just
tried different routes (which in computerese is called 'exhaustive search').
All of them?
Yes, all of them. There were only four flowers to go to. And as Jason pointed out the
bees didn't 'solve' the problem in the sense of always taking the shortest route - they
only did so 40% of the time.
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To post to this group, send email to firstname.lastname@example.org.
To unsubscribe from this group, send email to
For more options, visit this group at