I have the intuition that Levin search may not be the most efficient way to search programs, because it operates very differently from human programming. I guess better ways to generate programs can be achieved by imitating human programming -- using techniques such as deductive reasoning and planning. This second method may be faster than Levin-style searching, especially for complex programming problems, yet technically it is still a search algorithm.
My questions are: Is deductive-style programming more efficient than Levin-search? If so, why is it faster? YKY ----- 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=63817344-75ac57
