Model of intelligent agent in the one dimensional dicrete world
Vjacheslav OsaulenkoModern computing is mostly performed on a sequential architecture with a separate processor and memory. Living organisms use parallel computing, and it is believed that it provides them with the ability to solve such complex tasks as pattern recognition and to demonstrate intellectual behavior in general. There is a need for more biologically based approaches to information processing. The aim of the study is to propose a new way of measuring complexity on an example of a one-dimensional binary vector. This will help to better formalize the agent's purpose, and impose upper bounds of it’s ability to recognize and predict patterns in the environment. As a compromise between entropy and Kolmogorov's complexity, it is proposed to use joint entropy of n-grams, which has no deficiencies of the first one and can be computed exactly, in contrast to the second. It is shown that by varying this measure it is possible to move from the states of completely random world to fully organized with a gradual change in complexity. Taking the agent's goal to make the best predictions, the esense of a new measure manifests itself, indicating the resources needed to achieve the goal for a specific environment. Also, a brief overview of the unresolved problems of modeling the intelligence of the agent and possible ways to solve them is presented. Overall, a new degree of complexity is proposed, joint entropy of n-gram, which can be calculated precisely for input data. A measure is deduced for the agent, which predicts patterns in the data, and can be applied to assess the required complexity of the agent model. The disadvantage of the new measure is its high computational complexity for high-dimensional data. New research is needed for simplification and further application