> "is the algorithm smart enough to eventually internalise its own model of itself?"
As far as I understood, it's just random search for models ("For the planning component we use standard Monte Carlo"), and some kind of minimum description length (MDL) based method for model selection ("For the learning component we use standard file compression algorithms").
So the probability that it would, by Monte Carlo search, find a model that includes some kind of description for itself, I assume to be astronomically tiny.
(...And even if it did, it would have no way to know that it has stumbled upon a model of itself. Except the experimental performance of the model, which could or could not be better than some other models and variations.)
As far as I understood, it's just random search for models ("For the planning component we use standard Monte Carlo"), and some kind of minimum description length (MDL) based method for model selection ("For the learning component we use standard file compression algorithms").
So the probability that it would, by Monte Carlo search, find a model that includes some kind of description for itself, I assume to be astronomically tiny.
(...And even if it did, it would have no way to know that it has stumbled upon a model of itself. Except the experimental performance of the model, which could or could not be better than some other models and variations.)