Computation: The edge of reductionism

@article{Binder2009ComputationTE,
  title={Computation: The edge of reductionism},
  author={P.-M. Binder},
  journal={Nature},
  year={2009},
  volume={459},
  pages={332-334}
}
Research at the frontier between computer science and physics illustrates the shortcomings of the reductionist approach to science, which explains macroscopic behaviour using microscopic principles. 
Nature, computation and complexity
TLDR
It is suggested that physical computation as the authors know it exists only as a tool of complex biological systems: us.
Complexity and Information Theory
TLDR
This chapter offers an account of several common measures of complexity and the relation of complexity to predictability and emergence.
Emergent complexity in simple neural systems
The ornate and diverse patterns of seashells testify to the complexity of living systems. Provocative computational explorations have shown that similarly complex patterns may arise from the
Self-organization and Emergence of Dynamical Structures in Neuromorphic Atomic Switch Networks
TLDR
The construction of purpose-built dynamical systems consisting of highly interconnected, physically recurrent networks of inorganic synapses, known as atomic switch networks, are introduced to demonstrate the utility of ASNs as a uniquely scalable physical platform capable of exploring the dynamical interface of complexity, neuroscience, and engineering.
A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems
  • Heiko Hamann
  • Computer Science
    2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems
  • 2013
TLDR
A recipe for a data-driven, iterative process for determining, testing, and refining hypotheses about how the self-organizing decision-making system operates is presented, which relies on the definition of Markov chains and their analysis based on an urn model.
The Necessary and Sufficient Conditions for Emergence in Systems Applied to Symbol Emergence in Robots
TLDR
Downward causation is shown to be a critical requirement for potentially emergent phenomena to be considered actually emergent and this approach for detecting emergence is applied to complex projects and symbol emergence in robots.
Neuronal network analyses: premises, promises and uncertainties
  • D. Parker
  • Computer Science, Medicine
    Philosophical Transactions of the Royal Society B: Biological Sciences
  • 2010
TLDR
The criteria that need to be satisfied for network understanding are discussed, and how they relate to traditional and novel approaches being applied to addressing network function are highlighted.
Invertebrate central pattern generator circuits
  • A. Selverston
  • Biology, Medicine
    Philosophical Transactions of the Royal Society B: Biological Sciences
  • 2010
TLDR
Why it is useful to have well-defined circuits with which to examine various computational models that can be validated experimentally and possibly applied to brain circuits when the details of such circuits become available is discussed.
Aggregate Materials beyond AIEgens
  • Zheng Zhao, Wei He, Ben Zhong Tang
  • Accounts of Materials Research
  • 2021
...
1
2
...

References

SHOWING 1-10 OF 11 REFERENCES
Philosophy of science: Theories of almost everything
A provocative contribution to the logic of science extends the theorems of Kurt Godel and Alan Turing, and bears on thinking about prediction, the standard model of particles, and quantum gravity.
Is the end in sight for theoretical physics? : an inaugural lecture
In this article I want to discuss the possibility that the goal of theoretical physics might be achieved in the not too distant future, say, by the end of the century. By this I mean that we might
Undecidability and intractability in theoretical physics.
  • Wolfram
  • Computer Science, Medicine
    Physical review letters
  • 1985
TLDR
Cellular automata are used to provide explicit examples of various formally undecidable and computationally intractable problems and it is suggested that such problems are common in physical models, and some other potential examples are discussed.
Computation Beyond the Turing Limit
TLDR
A simply described but highly chaotic dynamical system called the analog shift map is presented here, which has computational power beyond the Turing limit (super-Turing); it computes exactly like neural networks and analog machines.
Unpredictability and undecidability in dynamical systems.
  • Moore
  • Physics, Medicine
    Physical review letters
  • 1990
TLDR
It is shown that motion with as few as three degrees of freedom can be equivalent to a Turing machine, and so be capable of universal computation.
More really is different
Abstract In 1972, P.W. Anderson suggested that ‘More is Different’, meaning that complex physical systems may exhibit behavior that cannot be understood only in terms of the laws governing their
Computational Complexity and Statistical Physics
TLDR
Computational Complexity and Statistical Physics will serve as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems.
Cellular Automata Machines
TLDR
A cellular automata machine is a computer optimized for the simulation of cellular Automata that allows it to run thousands of times faster than a general-purpose computer of comparable cost programmed to do the same task.
Equivalence of Cellular Automata to Ising Models and Directed Percolation
Time development of cellular automata in $d$ dimensions is mapped onto equilibrium statistical mechanics of Ising models in $d+1$ dimensions. Directed percolation is equivalent to a cellular
An autonomous molecular computer for logical control of gene expression
TLDR
An autonomous biomolecular computer is described that, at least in vitro, logically analyses the levels of messenger RNA species, and in response produces a molecule capable of affecting levels of gene expression.
...
1
2
...