Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable

摘要

Open ended evolution seeks computational structures whereby creation of unbounded diversity and novelty are possible. However, research has run into a problem known as the "novelty plateau" where further creation of novelty is not observed. Using standard algorithmic information theory and Chaitin's Incompleteness Theorem, we prove no algorithm can detect unlimited novelty. Therefore observation of unbounded novelty in computer evolutionary programs is nonalgorith-mic and, in this sense, unknowable.