Show simple item record

Computation at the edge of chaos: Phase transitions and emergent computation.

dc.contributor.authorLangton, Christopher Gale
dc.contributor.advisorBurks, Arthur W.
dc.contributor.advisorHolland, John H.
dc.date.accessioned2016-08-30T16:53:56Z
dc.date.available2016-08-30T16:53:56Z
dc.date.issued1991
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9124042
dc.identifier.urihttps://hdl.handle.net/2027.42/128693
dc.description.abstractComputations are dynamical systems. The formal study of dynamical systems has revealed a spectrum of behaviors ranging from fixed-point dynamics to fully developed chaos. How does computation--especially universal computation--fit into this spectrum of dynamical behaviors? This thesis addresses the question via the study of Cellular Automata (CA). CA are discrete space/time dynamical systems which (a) exhibit the full spectrum of dynamical behaviors, and (b) are known to support universal computation. Therefore, if we can locate the CA which support computation in the full spectrum of CA dynamics, we may learn a great deal about the general relationship between computation and dynamics. We find that, with an appropriate parameterization of the space of CA, we can order CA dynamical behaviors from fixed-point, through periodic, to chaotic behavior. We also find that there exists a phase-transition in this sequence, located between the periodic and the chaotic rules. The dynamics in the vicinity of this phase-transition are the most complex exhibited anywhere in the spectrum, both qualitatively and quantitatively. These complex rules exhibit many of the properties deemed necessary to support computation, and therefore we are able to identify computation with a phase-transition in the space of CA. We are also able to explain the existence of--and relationships between--previously suggested classes of CA behavior (such as the four Wolfram classes) in terms of this phase-transition in the space of CA. The results reported here suggest a general relationship between computation and phase-transitions, especially second-order phase-transitions. When viewed from this perspective, one is able to explain a great deal of the phenomenology of computation, such as the existence of complexity classes, computability classes, and the Halting problem. This view also leads to some new suggestions about the nature and origin of such complex natural phenomena as Life and Intelligence.
dc.format.extent185 p.
dc.languageEnglish
dc.language.isoEN
dc.subjectCellular Automata
dc.subjectChaos
dc.subjectComputation
dc.subjectEdge
dc.subjectEmergent
dc.subjectPhase
dc.subjectTransitions
dc.titleComputation at the edge of chaos: Phase transitions and emergent computation.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineApplied Sciences
dc.description.thesisdegreedisciplineComputer science
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/128693/2/9124042.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.