--- On Fri, 10/24/08, Russell Wallace <[EMAIL PROTECTED]> wrote: > On Fri, Oct 24, 2008 at 4:54 PM, Matt Mahoney > <[EMAIL PROTECTED]> wrote: > > That's why you need a fault tolerant language that > works well with redundancy. However you still have the > inherent limitation that genetic algorithms can learn no > faster than 1 bit per population doubling. > > More to the point, being a form of blind search, the runtime is > generally exponential in the size of the solution being found. A > fault-tolerant language reduces the size of the exponent, but doesn't > solve the fundamental problem.
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. > > > That is not all I am doing. Look at the top ranked > text compressors. They implement fairly sophisticated > language models, though still far below adult level. > > Right, sorry, I had momentarily forgotten that you classify file > compression under the heading of natural language. Yes, those programs > have some algorithmic subtlety, but they deal with fairly simple data > structures, so any programming language that can compile into fast > machine code will suffice. Neurons are also simple data structures. -- 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
