Language for Description of Worlds. Part 2: The Sample World


  • Dimiter Dobrev Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria



Artificial General Intelligence, Language for description of worlds, Event-Driven Model, Definition of Algorithm


This is the second part of the paper. In this part we will use the world of the chess game in order to create the language we are looking for. We will show how a complex world can be described in a simple and understandable way. Before describing the movement of chess pieces, we will need to extend the concept of algorithm. The new concept describes the algorithm as a sequence of actions performed in an arbitrary world. In the meaning of the new concept, a cooking recipe is also an algorithm. If we look at a world in which there is an infinite tape and a head which travels over the tape, then the algorithm of that world will be a Turing machine. This means that the new concept of algorithm is a generalization of the old one. Computer programs are algorithms both in the new concept and in the old one, however, there are many other sequences of actions which extend the concept.