"Vladimir Romanov has released what he claims is a polynomial-time algorithm for solving 3-SAT. Because 3-SAT is NP-complete, this would imply that P==NP. While there's still good reason to be skeptical that this is, in fact, true, he's made source code available and appears decidedly more serious than most of the people attempting to prove that P==NP or P!=NP. Even though this is probably wrong, just based on the sheer number of prior failures, it seems more likely to lead to new discoveries than most. Note that there are already algorithms to solve 3-SAT, including one that runs in time (4/3)^n and succeeds with high probability. Incidentally, this wouldn't necessarily imply that encryption is worthless: it may still be too slow to be practical."
Tom Gheysens on 14 Oct 13I have no idea if an algorithm based on this already exists, but it would certainly be a good one for autonomous AI, I think. I think an algorithm based on this should be able to select his own input parameters and reject them if they are not stimulated any further or integrate them in the algorithm if they are continiously stimulated... this could enable self learning, etc.
johannessimon81 on 14 Oct 13By steering the neuron's back to an intermediate activity level the mechanism probably optimizes their efficiency within the network (after all a neuron that fires all the time is just as useless as one that never fires).
