On the Limits of Self-Improving in LLMs and Why AGI, ASI and the Singularity Are Not Near Without Symbolic Model Synthesis
DOI:
https://doi.org/10.70777/si.v2i4.17159Keywords:
Model Collapse, Large Language Models (LLMs), Recursive Self-Improvement, Entropy Decay, Variance Amplification, Coding Theorem Method (CTM), Algorithmic Information Dynamics, Neurosymbolic Approaches, large language model limitationsAbstract
We formalise recursive self-training in Large Language Models (LLMs) and Generative AI as a discrete-time dynamical system and prove that, as training data become increasingly self-generated (αt → 0), the system undergoes inevitably degenerative dynamics. We derive two fundamental failure modes: (1) Entropy Decay, where finite sampling effects cause a monotonic loss of distributional diversity (mode collapse), and (2) Variance Amplification, where the loss of external grounding causes the model’s representation of truth to drift as a random walk, bounded only by the support diameter. We show these behaviours are not contingent on architecture but are consequences of distributional learning on finite samples. We further argue that Reinforcement Learning with imperfect verifiers suffers similar semantic collapse. To overcome these limits, we propose a path involving symbolic regression and program synthesis guided by Algorithmic Probability. The Coding Theorem Method (CTM) allows for identifying generative mechanisms rather than mere correlations, escaping the data-processing inequality that binds standard statistical learning. We conclude that while purely distributional learning leads to model collapse, hybrid neurosymbolic approaches offer a coherent framework for sustained self-improvement.
References
Alemohammad, S., Casco-Rodriguez, J., Luzi, L., Humayun, A. I., Babaei, H., LeJeune, D., Siahkoohi, A., and Baraniuk, R. G. (2023). Self-Consuming Generative Models Go MAD. arXiv preprint arXiv:2307.01850.
Arjovsky, M., Chintala, S., and Bottou, L. (2017). Wasserstein Generative Adversarial Networks. In Proceedings of the 34th International Conference on Machine Learning (ICML), pp. 214–223. PMLR.
Calude, C. S. Information and Randomness: An Algorithmic Perspective, 2nd ed., Springer, Berlin, Heidelberg, 2002.
Chaitin, G. J. (1969). On the Length of Programs for Computing Finite Binary Sequences. Journal of the ACM, vol. 13, no. 4, pp. 547–569.
Cover, T. M. and Thomas, J. A. Elements of Information Theory, 2nd ed., Wiley-Interscience, Hoboken, NJ, 2006.
Delahaye, J.-P. and Zenil, H. (2012). Numerical Evaluation of Algorithmic Complexity of Short Strings: A Glance Into the Innermost Structure of Algorithmic Randomness. Applied Mathematics and Computation, vol. 219, pp. 63–77.
Good, I. J. (1965). Speculations Concerning the First Ultraintelligent Machine. In Advances in Computers, vol. 6, pp. 31–88. Elsevier.
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B.,Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014). Generative Adversarial Nets. In Advances in Neural Information Processing Systems, vol. 27. 24
Goertzel, B. and Pennachin, C. (eds.), Artificial General Intelligence, Springer, Berlin, Heidelberg, 2007.
Kant, I. (1781). Critique of Pure Reason. Johann Friedrich Hartknoch, Riga.
Kolmogorov, A. N. (1965). Three Approaches to the Quantitative Definition of Information. Problems of Information Transmission, vol. 1, no. 1, pp. 1–7.
Kurzweil, R. The Singularity Is Near: When Humans Transcend Biology, Viking Press, New York, 2005.
Kurzweil, R. (2005). The Singularity Is Near: When Humans Transcend Biology. Viking Press.
Levin, L. A. (1974). Laws of Information Conservation (Non-growth) and Aspects of the Foundations of Probability Theory. Problems of Information Transmission, vol. 10, no. 3, pp. 206–210.
OpenAI (2023). GPT-4 Technical Report. arXiv preprint arXiv:2303.08774.
Pearl, J. Causality: Models, Reasoning, and Inference, 2nd ed., Cambridge University Press, Cambridge, 2009.
Rombach, R., Blattmann, A., Lorenz, D., Esser, P., and Ommer, B. (2022). High-Resolution Image Synthesis with Latent Diffusion Models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 10684–10695.
Shannon, C. E. (1948). A Mathematical Theory of Communication. Bell System Technical Journal, vol. 27, pp. 379–423, 623–656.
Shumailov, I., Shumaylov, Z., Zhao, Y., Gal, Y., Papernot, N., and Anderson, R. (2023). The Curse of Recursion: Training on Generated Data Makes Models Forget. arXiv preprint arXiv:2305.17493.
Shumailov, I., Shumaylov, Z., Zhao, Y., Papernot, N., Anderson, R., and Gal, Y. (2024). AI models collapse when trained on recursively generated data. Nature, vol. 631, pp. 755–759.
Solomonoff, R. J. (1964). A Formal Theory of Inductive Inference. Parts I and II. Information and Control, vol. 7, pp. 1–22 and 224–254.
Hern´andez-Espinosa, A., Ozelim, L., Abrah˜ao, F. S., and Zenil, H. (2025). SuperARC: An Agnostic Test for Narrow, General, and Super Intelligence Based On the Principles of Recursive Compression and Algorithmic Probability. arXiv preprint arXiv:2307.01850. 25
Vinge, V. (1993). The Coming Technological Singularity: How to Survive in the Post-Human Era. Whole Earth Review, no. 81, pp. 88–95.
Zenil, H., Kiani, N. A., and Tegn´er, J. “An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems,” iScience, vol. 23, no. 3, p. 100911, 2020.
Zenil, H., Hern´andez-Orozco, S., Kiani, N. A., Soler-Toscano, F., and Rueda- Toicen, A. “A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity,” Entropy, vol. 20, no. 8, p. 605, 2018.
Zenil, H., Kiani, N. A., and Tegn´er, J. Algorithmic Information Dynamics: A Computational Approach to Causality with Applications to Living Systems, Cambridge University Press, 2023.
Zenil, H. Do-Calculus as an Incomplete Theory of Causation: From Correlation-Bound Inference to Algorithmic Mechanistic Causality.
Downloads
Published
How to Cite
Issue
Section
Categories
License
Copyright (c) 2026 Hector Zenil

This work is licensed under a Creative Commons Attribution 4.0 International License.