Evolutionary Turing in the Context of Evolutionary Machines

04/13/2013
by   Mark Burgin, et al.
0

One of the roots of evolutionary computation was the idea of Turing about unorganized machines. The goal of this work is the development of foundations for evolutionary computations, connecting Turing's ideas and the contemporary state of art in evolutionary computations. To achieve this goal, we develop a general approach to evolutionary processes in the computational context, building mathematical models of computational systems, functioning of which is based on evolutionary processes, and studying properties of such systems. Operations with evolutionary machines are described and it is explored when definite classes of evolutionary machines are closed with respect to basic operations with these machines. We also study such properties as linguistic and functional equivalence of evolutionary machines and their classes, as well as computational power of evolutionary machines and their classes, comparing of evolutionary machines to conventional automata, such as finite automata or Turing machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2023

The group of reversible Turing machines: subgroups, generators and computability

We study an abstract group of reversible Turing machines. In our model, ...
research
06/26/2018

Quantum Random Self-Modifiable Computation

Among the fundamental questions in computer science, at least two have a...
research
07/23/2009

Beyond Turing Machines

This paper discusses "computational" systems capable of "computing" func...
research
06/18/2019

Algorithmic measurement procedures

Measurements are shown to be processes designed to return figures: they ...
research
12/14/2014

The Computational Theory of Intelligence: Applications to Genetic Programming and Turing Machines

In this paper, we continue the efforts of the Computational Theory of In...
research
06/29/2022

On the relation of order theory and computation in terms of denumerability

Computability on uncountable sets has no standard formalization, unlike ...
research
12/06/2022

Non-Computability of the Pseudoinverse on Digital Computers

The pseudoinverse of a matrix, a generalized notion of the inverse, is o...

Please sign up or login with your details

Forgot password? Click here to reset