Hi all,
My new futurist tract The Cosmist Manifesto is now available on
Amazon.com, courtesy of Humanity+ Press:
http://www.amazon.com/gp/product/0984609709/
Thanks to Natasha Vita-More for the beautiful cover, and David Orban
for helping make the book happen...
-- Ben
--
Ben Goertzel, PhD
Yes we could do a 4x4 tic tac toe game like this in a PC. The training sets
can be generated simply by playing the agents against each other using
random moves and letting the agents know if it passed or failed as a
feedback mechanism.
Cheers,
Deepak
On Wed, Jul 21, 2010 at 9:02 AM, Matt Mahoney
Mike Tintner wrote
You partly illustrate my point - you talk of artificial brains as if
they actually exist
That's the magic of thinking in scenarios. For you it may appear as if
we couldn't differentiate between reality and a thought experiment.
By implicitly pretending that artificial
Training data is not available in many real problems. I don't think training
data should be used as the main learning mechanism. It likely won't solve
any of the problems.
On Jul 21, 2010 2:52 AM, deepakjnath deepakjn...@gmail.com wrote:
Yes we could do a 4x4 tic tac toe game like this in a PC.
Matt,
How did you learn to play chess? Or write programs? How do you teach people
to write programs?
Compare and contrast - esp. the nature and number/ extent of instructions -
with how you propose to force a computer to learn below.
Why is it that if you tell a child [real AGI] what to
A child AGI should be expected to need help learning how to solve many
problems, and even be told what the steps are. But at some point it needs
to have developed general problem-solving skills. But I feel like this is
all stating the obvious.
On Tue, Jul 20, 2010 at 11:32 PM, Matt Mahoney
Oh... and, a PDF version of the book is also available for free at
http://goertzel.org/CosmistManifesto_July2010.pdf
;-) ...
ben
On Tue, Jul 20, 2010 at 11:30 PM, Ben Goertzel b...@goertzel.org wrote:
Hi all,
My new futurist tract The Cosmist Manifesto is now available on
Amazon.com,
That's fantastic.
Next steps I am going to do:
- set up a Kindle edition
- set up an iBooks edition
- set up a Scribd edition
D
David Orban
skype, twitter, linkedin, sl, etc: davidorban
On Wed, Jul 21, 2010 at 8:01 AM, Ben Goertzel b...@goertzel.org wrote:
Oh... and, a PDF version of the
Infants *start* with general learning skills - they have to extensively
discover for themselves how to do most things - control head, reach out, turn
over, sit up, crawl, walk - and also have to work out perceptually what the
objects they see are, and what they do... and what sounds are, and
Mike Tintner wrote:
The fantasy of a superAGI machine that can grow individually without a vast
society supporting it, is another one of the wild fantasies of AGI-ers
and Singularitarians that violate truly basic laws of nature. Individual
brains
cannot flourish individually in the real
Jim Bromer wrote:
The question was asked whether, given infinite resources could Solmonoff
Induction work. I made the assumption that it was computable and found that
it
wouldn't work.
On what infinitely powerful computer did you do your experiment?
My conclusion suggests, that the use
I completely agree with this characterization, I was just pointing out the
importance already-existing generally intelligent entities in providing
scaffolding for the system's learning and meta-learning processes.
On Wed, Jul 21, 2010 at 12:25 PM, Mike Tintner tint...@blueyonder.co.ukwrote:
Matt,
I never said that I did not accept the application of the method of
probability, it is just that is has to be applied using logic. Solomonoff
Induction does not meet this standard. From this conclusion, and from other
sources of information, including the acknowledgement of incomputability
I meant this was what I said was: My conclusion suggests, that the use of
Solmonoff Induction as an ideal for compression or something like MDL is not
only unsubstantiated but based on a massive inability to comprehend the idea
of a program that runs every possible program.
What Matt said was: It
The fundamental method of Solmonoff Induction is trans-infinite. Suppose
you iterate through all possible programs, combining different programs as
you go. Then you have an infinite number of possible programs which have a
trans-infinite number of combinations, because each tier of combinations
I should have said, It would be unwise to claim that this method could stand
as an ideal for some valid and feasible application of probability.
Jim Bromer
On Wed, Jul 21, 2010 at 2:47 PM, Jim Bromer jimbro...@gmail.com wrote:
The fundamental method of Solmonoff Induction is trans-infinite.
I haven't made any noteworthy progress on my attempt to create a polynomial
time Boolean Satisfiability Solver.
I am going to try to explore some more modest means of compressing formulas
in a way so that the formula will reveal more about individual combinations
(of the Boolean states of the
But surely a number is a group of binary combinations if we represent the
number in binary form, as we always can. The real theorems are those which
deal with *numbers*. What you are in essence discussing is no more or less
than the *Theory of Numbers.*
*
*
* - Ian Parker
*
On 21 July 2010 20:17,
Because a logical system can be applied to a problem, that does not mean
that the logical system is the same as the problem. Most notably, the
theory of numbers contains definitions that do not belong to logic per se.
Jim Bromer
On Wed, Jul 21, 2010 at 3:45 PM, Ian Parker ianpark...@gmail.com
Jim,
This argument that you've got to consider recombinations *in addition to*
just the programs displays the lack of mathematical understanding that I am
referring to... you appear to be arguing against what you *think* solomonoff
induction is, without checking how it is actually defined...
You claim that I have not checked how Solomonoff Induction is actually
defined, but then don't bother mentioning how it is defined as if it would
be too much of an ordeal to even begin to try. It is this kind of evasive
response, along with the fact that these functions are incomputable, that
Well, Boolean Logic may be a part of number theory but even then it is still
not the same as number theory.
On Wed, Jul 21, 2010 at 4:01 PM, Jim Bromer jimbro...@gmail.com wrote:
Because a logical system can be applied to a problem, that does not mean
that the logical system is the same as the
The Theory of Numbers as its name implies about numbers. Advanced Theory of
Number is also about things like Elliptic Functions, Modular functions,
Polynomials, Symmetry groups, the Riemann hypothesis.
What I am saying is I can express *ANY* numerical problem in binary form. I
can use numbers,
If I can express Arithmetic in logical terms it must be.
- Ian Parker
On 21 July 2010 21:38, Jim Bromer jimbro...@gmail.com wrote:
Well, Boolean Logic may be a part of number theory but even then it is
still not the same as number theory.
On Wed, Jul 21, 2010 at 4:01 PM, Jim Bromer
On Wed, Jul 21, 2010 at 4:01 PM, Abram Demski abramdem...@gmail.com wrote:
Jim,
This argument that you've got to consider recombinations *in addition to*
just the programs displays the lack of mathematical understanding that I am
referring to... you appear to be arguing against what you
I can't say where you are going wrong because I really have no idea.
However, my guess is that you are ignoring certain contingencies that would
be necessary to make your claims valid. I tried to use a reference to the
theory of limits to explain this but it seemed to fall on deaf ears.
If I
If someone had a profound knowledge of Solomonoff Induction and the *science
of probability* he could at the very least talk to me in a way that I knew
he knew what I was talking about and I knew he knew what he was talking
about. He might be slightly obnoxious or he might be casual or (more
Jim Bromer wrote:
The fundamental method of Solmonoff Induction is trans-infinite.
The fundamental method is that the probability of a string x is proportional to
the sum of all programs M that output x weighted by 2^-|M|. That probability is
dominated by the shortest program, but it is
28 matches
Mail list logo
