Marcus Hutter

It needs to prove by itself that this change of program still satisfies the original specification.

And if it does so, then it replaces the original program by the improved program.

And by definition, it does the same job, but just faster.

And then it proves over it and over it.

And it's developed in a way that

all parts of this Gödel machine can self-improve, but it stays provably consistent with the original specification.

So from this perspective, it has nothing to do with ICSI, but if you would now put ICSI as the starting axioms in,

It would run ICSI, but that takes forever.

But then if it finds a provable speedup of ICSI, it would replace it by this and this and this.

And maybe eventually it comes up with a model which is still the ICSI model.

It cannot be.

I mean, just for the knowledgeable reader, ICSI is a computable.

And I can prove that.

Therefore, there cannot be a computable exact

algorithm computers, there needs to be some approximations.

And this is not dealt with the Gödel machine, so you have to do something about it.

But there's the ICSI TL model, which is finitely computable, which we could put in.

Which part of ICSI is non-computable?

The Solomonov induction part.

The induction.