Pragmatic Holism (or pragmatic reductionism)

The reductionist/holist debate is highly polarised. I propose an intermediate position of pragmatic holism. It derives from two claims: firstly, that irrespective of whether all natural systems are theoretically reducible, for many systems it is utterly impractical to attempt such a reduction, and secondly, that regardless of whether irreducible 'wholes’ exist, it is vain to try and prove this. This position illuminates the debate along new pragmatic lines by refocussing attention on the underlying heuristics of learning about the natural world.

[1]  Bruce Edmonds,et al.  What is Complexity? - The philosophy of complexity per se with application to some examples in evolution , 1995 .

[2]  Stephen Wolfram,et al.  Cellular automata as models of complexity , 1984, Nature.

[3]  Stevan Harnad,et al.  Symbol grounding problem , 1990, Scholarpedia.

[4]  Robert Rosen,et al.  Bionics revisited , 1993 .

[5]  F E Yates,et al.  Complexity and the limits to knowledge. , 1978, The American journal of physiology.

[6]  N. Cocchiarella,et al.  Situations and Attitudes. , 1986 .

[7]  Roger Penrose,et al.  Beyond the Doubting of a Shadow A Reply to Commentaries on Shadows of the Mind , 1996 .

[8]  Dov M. Gabbay,et al.  Classical vs non-classical logics (the universality of classical logic) , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[9]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[10]  Steven Weinberg,et al.  The First Three Minutes , 1998 .

[11]  G. Chaitin.  Randomness in arithmetic and the decline and fall of reductionism in pure mathematics , 1993, chao-dyn/9304002.

[12]  H T Siegelmann,et al.  Dating and Context of Three Middle Stone Age Sites with Bone Points in the Upper Semliki Valley, Zaire , 2007 .

[13]  Brian R. Gaines,et al.  On the Complexity of Causal Models , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[15]  Lars Löfgren,et al.  An axiomatic explanation of complete self-reproduction , 1968 .

[16]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[17]  HERBERT A. SIMON,et al.  The Architecture of Complexity , 1991 .

[18]  G. Kampis.  Self-modifying systems in biology and cognitive science , 1991 .

[19]  R. Rosen.  3 – Organisms as Causal Systems Which Are Not Mechanisms: An Essay into the Nature of Complexity , 1985 .

[20]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[21]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.