--- On Fri, 10/24/08, Russell Wallace <[EMAIL PROTECTED]> wrote: > <[EMAIL PROTECTED]> wrote: > > No. Genetic algorithms implement a beam search. It is > linear in the best case and exponential in the worst case. > It depends on the shape of the search space. > > It turns out that real search spaces are deceptive, so that > genetic algorithms are exponential in the typical case.
Only because it is hard to come up with representations that can be incrementally modified (don't break when you flip 1 bit). But nature has figured it out. > > Neurons are also simple data structures. > > Which is why Fortran is a perfectly suitable language for > implementing neural nets and neuron simulations. I prefer MMX and SSE2 assembler for x86. It allows you to evaluate 8 synapses in parallel. In PAQ8 I got 6 times the speed of optimized C. -- Matt Mahoney, [EMAIL PROTECTED] ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=117534816-b15a34 Powered by Listbox: http://www.listbox.com
