Emergent complexity and Turing Completeness Is there some link between the concept of emergence and Turing Completeness?  The ideas feel intuitively like they might be linked, but I can find nothing online.

The idea came to me because I was exploring Conway's Game of Life, and it was hard not to suppose a link between these two properties.

Edit: In response to Raphael's point, I have a clarification to the question (which I thought was implied, but in hindsight, it really wasn't)

Must it be the case that systems that exhibit weak emergent complexity are also Turing Complete?
I suggest you  to give  a look to S. Wolfram's book "A New Kind Of Science" (that is also available online). 

The centeral ideas are:


Computation is everywhere
Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Principle of Computational Equivalence)
Computation irreducibility: while many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up.


Though these ideas are probably not new, they are exposed in a fascinating way (to be honest, a rather informal and non-mathematical "way").