Ben wrote: > > In a bottom-up hierarchy of concepts (built up from micro-features) > > I'm afraid it is impossible to change to an entirely new bottom > > without having to rebuild the whole structure. > > Well, I disagree. I can prove you're wrong about "impossible", but the > interesting question is "how difficult in practical circumstances" and for > that I don't have a mathematical answer ... so we'll need to wait and see...
Well, I meant to say impractical, but that is just my intuition. We should explore this issue more. > Yes, I believe we have found > > * a relatively small subspace of the space of all "algorithms", which > displays a very wide variety of useful behaviors (we call this subspace > "zig-zag trees", they're a special kind of "combinator tree") > > * an efficient algorithm for searching this subspace (an improvement of > Pelikan and Goldberg's Bayesian Optimization Algorithm, enhanced to make use > of long-term memory via invocation of probabilistic term logic) I want to ask: is your class of algorithms guaranteed to terminate in a *bounded* time? If there is no such guarantee then things may get very complicated, bordering on the undecidable. OTOH, if it is time bounded (perhaps it contains no loops, no recursion or specific kinds of recursion only, etc), then the algorithms are more similar to functional transformations of the input space and therefore your approach would be similar to mine. Since the human retina contains roughly 1 million "pixels", *VISION* seems to require that we do simple operations on a lot of inputs, to repeatedly condense information. Therefore you probably don't want to do a lot of operations on your data. That's why algorithmic search may be inappropriate for vision (it's like multiplying a large number with another large number). The problem is when we have already processed the input space, then what does the resulting representation look like? Does it contain a relatively large number of concepts (like millions), or is it highly structured with few concepts on each level? We don't know now, but my model is assuming the first case. If it is the second case then your methods may be better. I suspect your approach is more suitable for things like theorem proving or other specific-domain problems... YKY -- _______________________________________________ Find what you are looking for with the Lycos Yellow Pages http://r.lycos.com/r/yp_emailfooter/http://yellowpages.lycos.com/default.asp?SRC=lycos10 ------- To unsubscribe, change your address, or temporarily deactivate your subscription, please go to http://v2.listbox.com/member/[EMAIL PROTECTED]
