On Measurable Tournaments for Progressing Generalized Cognizers
DOI:
https://doi.org/10.51408/1963-0145Keywords:
AGI, Generalized cognizers, Measuring of progressing, Local tournaments, Absolute orderingAbstract
Researchers such as Kurzweil and Goertzel predict that AI, due to the progress in LLM is entering a period of exponential growth toward Artificial General Intelligence (AGI). They believe that if such AGI is capable of rewriting its own code, it could evolve into a superhuman AI, possessing the cognitive and computational power of all human civilization
We interpret this requirement for AGI as an unavoidable ability of generalized cognizers to generate expectably reasonable versions of development of themselves, along with trustworthy means of measuring these versions and selecting the most promising of them wrt the utilities of cognizers.
Generalizing our prior assertion that knowledge-based chess strategies can be strongly scaled by local tournaments, we argue an analogous statement for suitable measuring of the progress of generalized cognizers in the frame of an adequate theory of cognizing and address to the ways to strengthen it.
References
R. Kurzweil, The Singularity Is Closer, 2024.
B. Goertzel, “Singularity can become real already in 2027,” Beneficial AGI Conference, 2024 [Online]. Available: https://hightech.plus/2024/03/07/
Evolutionary algorithms, Wikipedia, [Online]. Available: https://en.wikipedia.org/wiki/Evolutionary algorithm
E. Pogossian, Adaptation of Combinatorial Algorithms, Academy of Sciences of Armenia, 1983.
E. Pogossian, “Management strategy search and assessment programming”, Proceedings of International Conference Computer Science and Information Technologies, Armenia, 1999.
E. Pogossian, “On assessment of performance of systems by combining on-the-job and expert attributes scales,” International Conference in Computer Sciences and Information Technologies, pp. 331–335, Yerevan, Armenia, 2015.
E. Pogossian, “Standardizing measurements of performance of human and technical systems,” Proceedings of International Conference ‘Current Issues of Psychology of Management’, pp. 354–362, Yerevan, September 10–11, 2017.
Elo rating system, Wikipedia, [Online]. Available: https://en.wikipedia.org/wiki/Elo rating system
J. Flavell, The Developmental Psychology of Jean Piaget, D. VanNostrand Comp. Inc., Princeton, N.j., 1962.
E. Pogossian, Constructing Models of Being by Cognizing, Academy of Sciences of Armenia, Yerevan, Armenia, 2020.
E. Pogossian, V. Vahradyan, and A. Grigoryan, “On competing agents consistent with expert knowledge,” Lecture Notes in Computer Science, AIS-ADM-07, St. Petersburg, Russia, pp. 229–241, 2007.
H. Blavatsky, Between Light and Darkness, Zhizn zamechatelnykh lyudei (in Russian), 2012.
C.-L. Chang and R. C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, San Diego, 1987.
S. Wolfram, “Foundations of biological evolution: more results, more surprises,” 2024. https://writings.stephenwolfram.com/2024/12/foundations-of-biologicalevolution-more-results-more-surprises/
E. Pogossian, “Effectiveness enhancing knowledge-based strategies for SSRGT class of defense problems,” in NATO ASI 2011, Prediction and Recognition of Piracy Efforts Using Collaborative Human-Centric Information Systems, Salamanca, Spain, pp. 16, 2011.
C. Shannon, “Programming a computer for playing chess,” Philosophical Magazine, Ser. 7, vol. 41, 1950.
A. Newell, J. C. Shaw, and H. A. Simon, “Report on a general problem-solving program,” Proceedings of the International Conference on Information Processing, pp. 256–264, 1959.
E. Zermelo, “¨Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels,” Proceedings of the Fifth International Conference of Mathematicians, Cambridge University Press, pp. 501–504, 1912.
Ch. Brutyan, I. Zaslavski, and L. Mkrtchyan, “On methods of automated synthesis of positional strategies in games,” Problemi Kibernetiki, vol. 19, pp. 41–75, 1967.
M. Botvinnik, About Solving Approximate Problems, S. Radio, Moscow (in Russian), 1979.
R. Benerji, Theory of Problem Solving, Mir, Moscow, 1972.
J. E. Laird, A. Newell, and P. S. Rosenbloom, “Soar: an architecture for general intelligence,” Artificial Intelligence, vol. 33, no. 1, pp. 1–64, 1987.
J. Laird, The Soar Cognitive Architecture, MIT Press, England, 2012.
S. V. Grigoryan and Z. H. Naghashyan, “Adequacy and application of models of cognizing by combinatorial games,” MPCS, vol. 62, pp. 25–42, Dec. 2024.
S. Grigoryan, “Automating acquisition and explanation of strategy knowledge,” Proceedings of CSIT Conference, pp. 21–23, 2021.
B. Karapetyan, “A high-level language for chess concepts,” Mathematical Problems of Computer Sciences, 1986.
E. Pogossian, “Specifying personalized expertise,” CELDA, pp. 151–159, Barcelona, Spain, 2006.
B. Karapetyan, “Classification of incompleteness of strategies,” Mathematical Aspects for Controlling Conflicts, pp. 45–48, Yerevan, 1987.
R. Simonyan, “On complexity of antagonistic completely informed finite games,” Mathematical Aspects for Controlling Conflicts, pp. 74–78.
R. Simonyan, “On complexity of specification Nim type strategies,” in Mathematical Aspects for Controlling Conflicts, pp. 78–81, Yerevan, 1987.
S. Grigoryan, “Research and development of algorithms and programs of knowledge acquisition and their effective application to resistance problems,” PhD Thesis, Yerevan, Armenia, 2016.
E. Pogossian, “Systems of incomparable sets with the smallest number of subsets,” PhD Thesis, Computing Center of Academy of Sciences, Moscow, 1970; also in Math. Problems of Cybernetics and Comp. Science, vol. XVI, pp. 148–161, Yerevan, 1986 (in Russian).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Edward M. Pogossian
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
