Re: Software Architecture/Design
"Nicholas \"Indy\" Ray" <[email protected]> Wed, 16 Jun 2010 17:55:54 -0700
| Newsgroups | gmane.games.devel.sweng |
|---|---|
| Message-ID | <[email protected]> |
On Thu, Jun 10, 2010 at 9:27 PM, Shaun Stamper <[email protected]>wrote: > Its always going to be an issue, until we have quantum computers. What i'm > arguing is that no matter what you do, if you hit a limit where the language > itself is the performance barrier, you *have to dig deeper* nothing more. > I feel it should be noted that quantum computers aren't the "do computation instantaneously" panacea you imply it is. There is a small subset of problems that algorithms can be constructed that they are particularly good at. They generally are of the bruteforce over a set of items that are reasonably simple to check algorithmically, and return the one that checks as true. As it turns out, they often seem to function similar to a randomly try one possible solution, and return it if it's true. Just that they are really lucky and choose the right possible solution first. Indy _______________________________________________ Sweng-Gamedev mailing list [email protected] http://lists.midnightryder.com/listinfo.cgi/sweng-gamedev-midnightryder.com