Jean Moulin

The progress in artificial intelligence enables us to conceive adaptive systems whose characteristics are nearer and nearer to those of living beings. These characteristics though depend on ingenious choices by the designer of these systems: Initial conditions, parameters, optimisation functions, gradient and measure of fitness within the environment. Nevertheless, in living systems which are non-finalist, there are no programmers or designers to conceive of such ingenious choices. Our paper “Self-Programming Machines (I)” presents a non-finalist model since initial states and functions are randomly chosen at the beginning and once and for all. In spite of the fact that they are non-finalist, these machines always stabilise at fixed points when they are connected to an external process.

Very often, living beings seem able to change their functioning when external conditions vary. In order to study this property, we have devised abstract machines whose internal organisation changes whenever the external conditions vary. The internal organisations of these machines, are as simple as possible, functions of discrete variables. We call such machines self-modifying automata.These machines stabilise after any transient steps when they go indefinitely through a loop called p-cycle or limit cycle of length p. More often than not, the p in the cycle is equal to one and the cycle reduces to a fixed point