Comp. Sci. / Eng. Complex Specified Information Irreducible Complexity

“Perfect Fidelity at Minimum Time”

Spread the love

For the delight of programmers here at UD, I include this post.

Over at the “Reference Frame,” a blog by Lubos Motl, string theorist, and physicist extraordinaire, he has this post on a new game for “gamers” calledQuantum Moves.

I don’t have time for any in-depth comment; however, for the programmers among us, here is a titillating quote from Motl’s blog:

In the paper, the authors remarkably demonstrated that using their intuition and heuristic approaches, the human players were able to find solutions to tasks in which the well-known classical optimization algorithms don’t work well – but the quantum computers would. The well-known classical optimization algorithms fail especially near the “quantum speed limit”, when the shortest process duration is combined with perfect fidelity. It means that many human players can move the potential and the wave function to its nearly precise target shape (perfect fidelity) at minimum time (yes, it’s better if you solve each level quickly), while computers with traditional algorithms couldn’t do such things.

Obviously, I don’t think that it proves that the human brains’ physiology is an example of a quantum computer – and I am confident that they don’t suggest such a thing, either. The temperature in the brain is too high and the decoherence is too fast, I think. But the heuristic strategies used by the humans seem new. The researchers were able to figure out what these strategies were and improve their “professional” methods to deal with such problems, too.

The relevance to UD is rather obvious, and in no need of comment. But, I will add that in this last sentence, we do gain an insight into what GA really are all about, don’t we?

One Reply to ““Perfect Fidelity at Minimum Time”

  1. 1
    PaV says:

    Has no one picked up on the fact that when these authors state, “It means that many human players can move the potential and the wave function to its nearly precise target shape (perfect fidelity) at minimum time (yes, it’s better if you solve each level quickly), while computers with traditional algorithms couldn’t do such things,” this means that human intelligence puts ‘blind search’ to shame?

    This is the whole point of ID.

Leave a Reply