Premium
Emergence and Universal Computation
Author(s) -
Lee Cassey
Publication year - 2004
Publication title -
metroeconomica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.256
H-Index - 29
eISSN - 1467-999X
pISSN - 0026-1386
DOI - 10.1111/j.0026-1386.2004.00191.x
Subject(s) - relevance (law) , cellular automaton , computable function , computation , function (biology) , computer science , macro , automaton , mathematical economics , work (physics) , economics , sociology , theoretical computer science , epistemology , artificial intelligence , political science , algorithm , law , philosophy , mechanical engineering , evolutionary biology , biology , programming language , engineering
Emergence refers to the spontaneous formation of higher level (macro) structures or patterns in complex systems. Attempts to formalize the notion of emergence via algorithmic complexity theory runs into the problem that the Kolmogorov complexity function is not computable. The reason for this motivates a closer examination of the link between emergence and universal computation. Following Wolfram's pioneering work in the classification of cellular automata behavior, the research programs of Langton and Crutchfield, while incomplete, provide important insights to economists seeking to understand the relevance of emergence and universal computation to their discipline. They lead to questions on the emergence of institutions and the concomitant changes in rule‐based behavior on the part of economic agents.