Algorithm-Theoretic Approach to Games

A nontraditional approach to games based on the concepts of the theory of algorithms is proposed. A game is regarded as a process of interaction between ideal computers that additionally are furnished with random-signal generators. A universal language is proposed for describing game rules and strategies. Formal definitions of fundamental game concepts are given and a number of theorems are presented. As one possible application of the algorithm-theoretic investigation of games, the author suggests the creation of a universal game system, i.e., a computer program capable of playing any game. The prospects for practical utilization of systems of this type are also discussed.