Re: [agi] How do we Score Hypotheses?

2010-07-14 Thread Jim Bromer
On Tue, Jul 13, 2010 at 9:05 PM, Jim Bromer jimbro...@gmail.com wrote: Even if you refined your model until it was just right, you would have only caught up to everyone else with a solution to a narrow AI problem. I did not mean that you would just have a solution to a narrow AI problem, but

Re: [agi] How do we Score Hypotheses?

2010-07-14 Thread David Jones
What do you mean by definitive events? I guess the first problem I see with my approach is that the movement of the window is also a hypothesis. I need to analyze it in more detail and see how the tree of hypotheses affects the hypotheses regarding the es on the windows. What I believe is that

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Matt Mahoney
Actually, Fibonacci numbers can be computed without loops or recursion. int fib(int x) { return round(pow((1+sqrt(5))/2, x)/sqrt(5)); } unless you argue that loops are needed to compute sqrt() and pow(). The brain and DNA use redundancy and parallelism and don't use loops because their

[agi] Comments On My Skepticism of Solomonoff Induction

2010-07-14 Thread Jim Bromer
Last week I came up with a sketch that I felt showed that Solomonoff Induction was incomputable *in practice* using a variation of Cantor's Diagonal Argument. I wondered if my argument made sense or not. I will explain why I think it did. First of all, I should have started out by saying

Re: [agi] Comments On My Skepticism of Solomonoff Induction

2010-07-14 Thread Matt Mahoney
Jim Bromer wrote: Last week I came up with a sketch that I felt showed that Solomonoff Induction was incomputable in practice using a variation of Cantor's Diagonal Argument. Cantor proved that there are more sequences (infinite length strings) than there are (finite length) strings, even

Re: [agi] How do we Score Hypotheses?

2010-07-14 Thread David Jones
Actually, I just realized that there is a way to included inductive knowledge and experience into this algorithm. Inductive knowledge and experience about a specific object or object type can be exploited to know which hypotheses in the past were successful, and therefore which hypothesis is most

Re: [agi] Comments On My Skepticism of Solomonoff Induction

2010-07-14 Thread Abram Demski
Jim, There is a simple proof of convergence for the sum involved in defining the probability of a given string in the Solomonoff distribution: At its greatest, a particular string would be output by *all* programs. In this case, its sum would come to 1. This puts an upper bound on the sum. Since

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Michael Swan
On Wed, 2010-07-14 at 07:48 -0700, Matt Mahoney wrote: Actually, Fibonacci numbers can be computed without loops or recursion. int fib(int x) { return round(pow((1+sqrt(5))/2, x)/sqrt(5)); } ;) I know. I was wondering if someone would pick up on it. This won't prove that brains have loops

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Matt Mahoney
Michael Swan wrote: What 3456/6 ? we don't know, at least not from the top of our head. No, it took me about 10 or 20 seconds to get 576. Starting with the first digit, 3/6 = 1/2 (from long term memory) and 3 is in the thousands place, so 1/2 of 1000 is 500 (1/2 = .5 from LTM). I write 500

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Mike Tintner
Michael :The brains slow and unreliable methods I think are the price paid for generality and innately unreliable hardware Yes to one - nice to see an AGI-er finally starting to join up the dots, instead of simply dismissing the brain's massive difficulties in maintaining a train of thought.

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Mike Tintner
A demonstration of global connectedness is - associate with anO I get: number, sun, dish, disk, ball, letter, mouth, two fingers, oh, circle, wheel, wire coil, outline, station on metro, hole, Kenneth Noland painting, ring, coin, roundabout connecting among other things - language,

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Michael Swan
On Wed, 2010-07-14 at 17:51 -0700, Matt Mahoney wrote: Michael Swan wrote: What 3456/6 ? we don't know, at least not from the top of our head. No, it took me about 10 or 20 seconds to get 576. Starting with the first digit, 3/6 = 1/2 (from long term memory) and 3 is in the thousands

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Robert Picone
On Wed, Jul 14, 2010 at 4:53 PM, Michael Swan ms...@voyagergaming.comwrote: On Wed, 2010-07-14 at 07:48 -0700, Matt Mahoney wrote: Actually, Fibonacci numbers can be computed without loops or recursion. int fib(int x) { return round(pow((1+sqrt(5))/2, x)/sqrt(5)); } ;) I know. I was

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Michael Swan
On Thu, 2010-07-15 at 01:37 +0100, Mike Tintner wrote: Michael :The brains slow and unreliable methods I think are the price paid for generality and innately unreliable hardware Yes to one - nice to see an AGI-er finally starting to join up the dots, instead of simply dismissing the

Re: [agi] What is the smallest set of operations that can potentially define everything and how do you combine them ?

2010-07-14 Thread Michael Swan
I'd argue that mathematical operations are unnecesary, we don't even have integer support inbuilt. I'd disagree. is a mathematical operation, and in combination can become an enormous number of concepts. Sure, I think the brain is more sensibly understood in a programattical sense than