Timeline for Is a genetic algorithm needed when computation is infinitely fast?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2014 at 13:30 | comment | added | Cruncher | There's much bigger consequence with infinite computation speed... For example, all recognizable problems now become decidable. Yay for the halting problem! | |
| Mar 20, 2014 at 9:11 | comment | added | deong | Even if quantum computers are perfected, we suspect (but don't yet know for sure) that NP-Complete is not a subset of BQP. If true, this means that the class of problems solvable by a quantum computer with high probability in polynomial time does not include the NP-hard optimization problems that one would generally use a GA for. | |
| Mar 20, 2014 at 9:05 | history | answered | Kilian Foth | CC BY-SA 3.0 |