The evolution of the machine mind language

Introducing the principle of symbolization and conceptualization, we present the algorithm for evolution of language of the machine mind. We verify the algorithm by sequential program in Haskell, introducing intermediate and output forms of language produced in each algorithm step. The output form is a fine-grained parallel and non-redundant structure of the machine mind language in a supercombinator form, in which the number of applications enormously exceeds the number of metaoperations. Instead of accumulating acquired information it is dissolved in the language of mind, and vice versa, it is reconstructed from this language. We present an abstract form of language of the machine mind, the principle of recognition of concepts by applicative automata and the principle of forming concrete concepts from language concepts form the machine mind. We indicate non-redundancy, as the criterion for restructuring the language of mind in each moment of communication. The goal of algorithmic evolution of the machine mind is to provide more abstract and powerful Human-Computer and Computer-Computer communication.