Re: [agi] Competing AGI approaches

2007-03-17 Thread Ben Goertzel
HI, Currently Ben's Novamente is among the most mature and promising AGIs out there, which I think is no small accomplishment. But still, it is not yet clear that NM will be the *ultimate* winner, if we take into consideration the entry of the big guys (eg Microsoft, Google, DARPA etc)

Re: [agi] Competing AGI approaches

2007-03-17 Thread YKY (Yan King Yin)
On 3/17/07, Ben Goertzel [EMAIL PROTECTED] wrote: 4) So, the question is not whether DARPA, M$ or Google will enter the AI race -- they are there. The question is whether they will adopt a workable approach and put money behind it. History shows that large organizations often fail to do so,

Re: [agi] Competing AGI approaches

2007-03-17 Thread Ben Goertzel
4) So, the question is not whether DARPA, M$ or Google will enter the AI race -- they are there. The question is whether they will adopt a workable approach and put money behind it. History shows that large organizations often fail to do so, even when workable approaches exist, allowing

Re: [agi] Competing AGI approaches

2007-03-17 Thread YKY (Yan King Yin)
On 3/18/07, Ben Goertzel [EMAIL PROTECTED] wrote: If we succeed at creating the first AGI, it will not be because anything fell into our hands. It will be because we a) put in the many years of hard thinking to create a working AGI design b) put in the many years of hard, often tedious, work

Re: [agi] Competing AGI approaches

2007-03-17 Thread Ben Goertzel
Hi, The question is whether your work can be duplicated after your initial success, and how hard is that. It certainly could be duplicated but once we demonstrate enough success that everyone wants to copy us, then we will be able to raise all the $$ we want and hire all the great

Re: [agi] Competing AGI approaches

2007-03-17 Thread Bob Mottram
On 17/03/07, YKY (Yan King Yin) [EMAIL PROTECTED] wrote: PS -- remember also the history of UNIVAC. Eckert and Mauchly made some ground-breaking progress in early computing, including the stored-program concept which somehow was stolen / co-discovered by von Neumann. Later von Neumann

[agi] Semi-amusing Novamente machinima

2007-03-17 Thread Ben Goertzel
Hi all, This doesn't really showcase Novamente's learning ability very much -- it's basically a smoke test of the integration of Novamente probabilistic learning with the AGISim sim world -- an integration which we've had sorta working for a while but has had a lot of kinks needing

Re: [agi] Semi-amusing Novamente machinima

2007-03-17 Thread Bob Mottram
It's difficult to judge how impressive or otherwise such demos are, since it would be easy to produce an animation of this kind with trivial programming. What are we really seeing here? How much does the baby AGI know about fetching before it plays the game, and how much does it need to learn?

Re: [agi] Semi-amusing Novamente machinima

2007-03-17 Thread Kevin Peterson
On 3/17/07, Ben Goertzel [EMAIL PROTECTED] wrote: This doesn't really showcase Novamente's learning ability very much -- it's basically a smoke test of the integration of Novamente probabilistic learning with the AGISim sim world -- an integration which we've had sorta working for a while but

Re: [agi] Semi-amusing Novamente machinima

2007-03-17 Thread J. Storrs Hall, PhD.
What's the size of the space NM is searching for this plan? If you rewarded it for, say, regularities in arithmetic, starting with set theory, how long would it take it to come up with, say, Goldbach's conjecture? Josh On Saturday 17 March 2007 16:05, Ben Goertzel wrote: Hi all, This

Re: [agi] Semi-amusing Novamente machinima

2007-03-17 Thread Ben Goertzel
Bob Mottram wrote: It's difficult to judge how impressive or otherwise such demos are, since it would be easy to produce an animation of this kind with trivial programming. What are we really seeing here? How much does the baby AGI know about fetching before it plays the game, and how

Re: [agi] Semi-amusing Novamente machinima

2007-03-17 Thread Ben Goertzel
What's the size of the space NM is searching for this plan? Well that really depends on how you count things One way to calculate it would be to look at the number of trees with 15 nodes, with say 20 possibilities at each node. Because in practice the plans it comes up with, with