Switch to: References

Add citations

You must login to add citations.
  1. Self-programming machines (II): Network of self-programming machines driving an Ashby homeostat.J.-P. Moulin - 2003 - Acta Biotheoretica 51 (4):265-276.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Very simple models, the self-modifying automata and chain of self-modifying automata, can explain self-referential properties of living beings.J. -P. Moulin - 1999 - Acta Biotheoretica 47 (3-4):353-365.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation