The Possible Irreducibility of Artificial Software Life - Bruce Edmonds
In theoretical biology, debate about reduction has been often been centred around reduction to a Turing machine, i.e. taking reducibility as computability (especially by opponents of reductionism, e.g. Rosen  or Pattee ). Given this, it is a foregone conclusion that (hardware glitches, and interaction with a real environment apart) that any artificial life would be reducible. Below I argue that this characterisation of reducibility is too weak for any deliberate reduction.
Using this criteria of reducibility the reductionist and holist positions can be pictured like this (after Rosen ).
Diagrams of some holist and reductionist views
Generated with CERN WebMaker