On Fri, Feb 8, 2013 at 11:56 AM, Piaget Modeler <[email protected]>wrote:
> What kinds of data objects are analyzed and what does analysis imply? > If the algorithms are not solutions to gaps or impediments then what > purpose do they serve? > Kindly explain. > ~PM > My guess is that I did not answer your question. In order to go from input to 'understanding' an AGI program would have to do some analysis of the input. The concept of analysis could be extended to an analysis of output as well and that would be an important part of an AGI program. The algorithms that I am talking about right now would not be 'solutions' per se because they would be analytics. In other words I am emphasizing a part of a greater process. The idea of 'algorithm generators' is what is important in this thread. So while I talked about methods of reducing complexity I was only talking about methods of reducing the complexity of using 'algorithm generators' in an AGI program. I am thinking out loud so to speak, trying to see if this is a good idea. And while this may seem similar to automatic programming I am not explicitly talking about automatic programming. The algorithms that would be generated and preserved would be held because they would seem to be taking part in an effective solution. However, I just do not see the idea of a AGI solution generator as meaningful. Yes, an effective AGI program would be an effective ;solution generator' but that sounds more like advertising than a reference to a feasible artifact of computer science. An algorithm generator is feasible. Jim Bromer On Fri, Feb 8, 2013 at 11:56 AM, Piaget Modeler <[email protected]>wrote: > What kinds of data objects are analyzed and what does analysis imply? > > If the algorithms are not solutions to gaps or impediments then what > purpose do they serve? > > Kindly explain. > > ~PM > > ------------------------------ > Date: Fri, 8 Feb 2013 11:33:10 -0500 > Subject: Re: [agi] Could Algorithm Generators be a Feasible and Effective > AGI Method? > From: [email protected] > To: [email protected] > > > On Fri, Feb 8, 2013 at 10:38 AM, Ben Goertzel <[email protected]> wrote: > > "Automated program learning" is a branch of AI that seems close to what > you have in mind... > This is what the MOSES component of OpenCog attempts to do, though it's > currently only really effective at learning simple sorts of programs... > -- Ben G > > > I described a very narrow type of programming object. An Algorithm > Generator. Because I was able to use such colloquial terms it is something > that almost everyone involved with programming should be able > to understand. Any AGI program would have to be capable of doing some > automated program learning. The question I was trying to explore was > whether or not an explicit system of algorithm generators would be useful > and how they might be used. One might argue that any AGI program that was > able to learn would effectively be creating (or generating) algorithms. > What I am talking about is the question of designing mechanisms that > explicitly generate kinds of algorithms. The algorithms that I have in mind > are not solution algorithms (per se) but analytical algorithms (including > algorithms that analyze data objects by making modifications). > Jim Bromer > > > *AGI* | Archives <https://www.listbox.com/member/archive/303/=now> > <https://www.listbox.com/member/archive/rss/303/10561250-470149cf> | > Modify<https://www.listbox.com/member/?&;>Your Subscription > <http://www.listbox.com> > ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
