Cohen, I. R. (2006). Informational landscapes in art, science, and evolution. Bulletin of Mathematical Biology 68 (5) (July): 1213–1229. URL http://dx.doi.org/10.1007/ s11538-006-9118-4 . 

Cook, M. (2004). Universality in elementary cellular automata. Complex Systems 15 (1): 1–40. 

Crutchfield, J. P. and Young, K. (1989). Inferring statistical complexity. Phys. Rev. Lett. 63 : 105–108. URL http://link.aps.org/doi/10.1103/PhysRevLett.63.105 . 

Delahaye, J.-P. and Zenil, H. (2007). On the Kolmogorov-Chaitin complexity for short sequences. In Randomness and Complexity: From Leibniz to Chaitin , C. S. Calude, (Ed.). World Scientific, 123. URL http://arxiv.org/abs/0704.1043 . 

$_{Delahaye, J.-P. and Zenil, H.}$(In Press). Numerical evaluation of algorithmic complex- ity for short strings: A glance into the innermost structure of randomness. Applied Math- ematics and Computation . URL http://dx.doi.org/10.1016/j.amc.2011.10.006 . 

$_{Derrida, B. and Pomeau, Y.}$(1986). Random networks of automata: A simple annealed approximation. Europhys. Lett. 1 (2): 45–49. 

Drossel, B. (2009). Random Boolean networks. In Reviews of Nonlinear Dynamics and Complexity , H. G. Schuster, (Ed.). Wiley-VCH Verlag GmbH & Co. KGaA, 69–110. URL http://dx.doi.org/10.1002/9783527626359.ch3 . 

$_{Edmonds, B.}$(1999). Syntactic measures of complexity. Ph.D. thesis, University of Manch- ester, Manchester, UK. URL http://bruce.edmonds.name/thesis/ . 

Edmonds, B. (2001). What if all truth is context-dependent? Tech. Rep. 01-77, CPM. URL http://cfpm.org/cpmrep77.html . 

Edmonds, B. and Gershenson, C. (2012). Learning, social intelligence and the Turing test - why an “out-of-the-box” Turing machine will not pass the Turing test. In How 

