2008/4/27 Dr. Matthias Heger <[EMAIL PROTECTED]>: > > Ben Goertzel [mailto:[EMAIL PROTECTED] wrote 26. April 2008 19:54 > > > > Yes, truly general AI is only possible in the case of infinite > > processing power, which is > > likely not physically realizable. > > How much generality can be achieved with how much > > Processing power, is not yet known -- math hasn't advanced that far yet. > > > My point is not only that 'general intelligence without any limits' would > need infinite resources of time and memory. > This is trivial of course. What I wanted to say is that any intelligence has > to be narrow in a sense if it wants be powerful and useful. There must > always be strong assumptions of the world deep in any algorithm of useful > intelligence.
I am probably the one on this list the closest to the position you think AGI means. I would agree. Any algorithms needs to be very specific to be useful. However the *architecture*, of an AGI needs to be general (by this I mean capable of instantiating any TM equivalent function, from input and current state to output and current state). So I think the the lowest level of the system space should be massive as you argue against. However I would not make it a search space, as such, with a fixed method searching it. On its own, it should be passive, however it is be able to have active programs within it. As these are programs on there own they can search the space of possible programs. These programs could search sub spaces of the entire space, or get information from the outside about which subspaces to search. However, there is no limit to which subspaces they do actually search. What makes my approach different to a bog standard computer system, is that it would guide the searching of the programs within it, by acting as reinforcement based ratchet. Those programs with the most reinforcement, that act sensibly, will be able to protect and expand the influence they have over the system. With the right internal programs and environment, this will look as if the system has a goal for what it is trying to become. See this post for more details. http://www.mail-archive.com/[email protected]/msg02892.html > Every recursive procedure has to have a non-reducible base and it is clear, > that the overall performance and abilities depend crucially on that basic > non-reducible procedure. If this procedure is too general, the performance > slows exponentially with the space with which this basic procedure works. There are recursive procedures that abandon the base, see for example booting a machine. Will Pearson ------------------------------------------- agi Archives: http://www.listbox.com/member/archive/303/=now RSS Feed: http://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: http://www.listbox.com/member/?member_id=8660244&id_secret=101455710-f059c4 Powered by Listbox: http://www.listbox.com
