Matt,
I know this is a late response, but your statement there is odd. The
halting problem is not algorithmically describable at all. It *does*
have a simple description, but not an algorithmic one (ie, not one
that can be completely captured by axioms). That is the whole point!
-Abram
On Wed, O
> From: Dr. Matthias Heger [mailto:[EMAIL PROTECTED]
>
> In my opinion, the domain of software development is far too ambitious
> for
> the first AGI.
> Software development is not a closed domain. The AGI will need at least
> knowledge about the domain of the problems for which the AGI shall
> wr
In my opinion, the domain of software development is far too ambitious for
the first AGI.
Software development is not a closed domain. The AGI will need at least
knowledge about the domain of the problems for which the AGI shall write a
program.
The English interface is nice but today it is just a
On Thu, Oct 16, 2008 at 2:05 PM, charles griffiths
<[EMAIL PROTECTED]> wrote:
> You have a point, but how would you propose giving specifications to the
> AGI-programmer? Teach it English? Always have it modify working programs with
> the same objectives (e.g., reduce runtime/memory, avoid crashi
On Thu, Oct 16, 2008 at 12:50 PM, Dr. Matthias Heger <[EMAIL PROTECTED]> wrote:
> The reasons:
> 1. The domain is well understood.
> 2. The domain has regularities. Therefore a high intelligent algorithm has a
> chance to outperform less intelligent algorithms
> 3. The domain can be modeled easily
My intention is not to define intelligence. I choose mathematics just as a
test domain for first AGI algorithms.
The reasons:
1. The domain is well understood.
2. The domain has regularities. Therefore a high intelligent algorithm has a
chance to outperform less intelligent algorithms
3. The doma
On Thu, Oct 16, 2008 at 1:35 AM, Matt Mahoney <[EMAIL PROTECTED]> wrote:
> Goedel and Turing showed that theorem proving is equivalent to solving the
> halting problem. So a simple measure of intelligence might be to count the
> number of programs that can be decided. But where does that get us?
--- On Wed, 10/15/08, Dr. Matthias Heger <[EMAIL PROTECTED]> wrote:
> Text compression would be AGI-complete but I think it is
> still too big.
> The problem is the source of knowledge. If you restrict to
> mathematical
> expressions then the amount of data necessary to teach the
> AGI is probably
Text compression would be AGI-complete but I think it is still too big.
The problem is the source of knowledge. If you restrict to mathematical
expressions then the amount of data necessary to teach the AGI is probably
much smaller. In fact AGI could teach itself using a current theorem prover.
-M
