Evolution of logic as an information processing mechanism in advanced biological systems.

Logic plays an important role in biological evolution. Some researchers even assume that evolution can be seen as a process of discovering the logic that works well in a particular environment. At the same time, logic can be treated as a biological system, or a superorganism, evolution of which goes in the social environment with its societal space and time. In this paper, syntactic aspects of the evolution of logic are studied demonstrating how logic evolves from the simplest logical species to the higher and higher logical species.

East-West paths to unconventional computing.

Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing. Unconventional computing encourages a new style of thinking while practical applications are obtained from uncovering and exploiting principles and mechanisms of information processing in and functional properties of, physical, chemical and living systems; in particular, efficient algorithms are developed, (almost) optimal architectures are designed and working prototypes of future computing devices are manufactured. This article includes idiosyncratic accounts of 'unconventional computing' scientists reflecting on their personal experiences, what attracted them to the field, their inspirations and discoveries.

Cooperative combinatorial optimization: evolutionary computation case study.

This paper presents a formalization of the notion of cooperation and competition of multiple systems that work toward a common optimization goal of the population using evolutionary computation techniques. It is proved that evolutionary algorithms are more expressive than conventional recursive algorithms, such as Turing machines. Three classes of evolutionary computations are introduced and studied: bounded finite, unbounded finite, and infinite computations. Universal evolutionary algorithms are constructed. Such properties of evolutionary algorithms as completeness, optimality, and search decidability are examined. A natural extension of evolutionary Turing machine (ETM) model is proposed to properly reflect phenomena of cooperation and competition in the whole population.