Computational irreducibility

Known as: Computational reducibility

Computational irreducibility is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2015

2015

The known theorem of Godel's incompleteness of formal axiomatic exhibited in the identification of an object, triggers the…

2008

Paper presents creative use of cellular automata (CA) in architecture, namely for dynamic shading of building facade. The…

2006

A key working hypothesis in neuroscience is ‘materialistic reductionism’, i.e., the assumption whereby all physiological…

2004

The evolving science of complex systems consists of many inter-related but incompletely synthesised observations and ideas…

1997

Some comments are offered on the papers given at the conference, which are divided into three groups: visual perception, models…

1995

We show how to associate a computation to certain 2 degree of freedom hamiltonian systems, and use this to discuss the level of…

1991

The question of the title I answer in the negative. There are four strands to my argument. The first, which corresponds to the…

1990

It is shown by direct numerical simulation of the incompressible Navier–Stokes equations that the vortex wakes of bluff objects…