>Richard Loosemore=====> None of the above is relevant. The issue is not whether toy problems set within the current paradigm can be done with this or that search algorithm, it is whether the current paradigm can be made to converge at all for non-toy problems.
Ed Porter=====> Richard, I wouldn't call a state of the art NL parser that matches parse trees in 500K dimensions a toy problem. Yes, it is much less than a complete human brain, but it is not a toy problem. With regard to Hecht-Nielsen's sentence completion program it is arguably a toy problem, but it operates extremely efficiently (i.e., converges) in an astronomically large search space, with a significant portion of that search space having some arguable activation. The fact that there is such efficient convergence in such a large search space is meaningful, and the fact that you just dismiss it, as you did in your last email as a trivial publicity stunt is also meaningful. Ed Porter ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=71705619-d121f2
