Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cellular Automata in Science
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.ORCID iD: 0000-0001-6302-7006
2005 (English)Other (Other (popular science, discussion, etc.))
Abstract [en]

Cellular automata have a widespread use in the description of complex phenomena in disciplines as disparate as, for example, physics and economics. A cellular automaton is a lattice of cells, and the cells can be in a finite number of states. By using simple local rules the states of the cells are updated in parallel at discrete time steps. In short, a cellular automaton can be characterised by the three words - simple, local, and parallel. These three words are one of the reasons for the attractiveness of cellular automata. They are simple to implement and they are well suited for parallel computers (computations). Another reason for using cellular automata are for their spatio-temporal properties. The lattice may represent space and the updating of the cells gives a

dimension of time.



In spite of the simplicity of cellular automata they may give rise to a complex macroscopic behaviour. This is illustrated, in this thesis, by an hydrodynamic example, namely the creation of vortices in flow behind a cylinder.



Although cellular automata have the ability to describe complex phenomena it is sometimes hard to find the proper rules for a given macroscopic behaviour. One approach which has been successfully employed is to let cellular automata rules evolve (for example, through genetic algorithms) when finding the desired properties. In this thesis this is demonstrated for two-dimensional cellular automata with two possible states of the cells. A genetic algorithm is used to find rules that evolve a given initial configuration of the cells to another given configuration.

Place, publisher, year, pages
2005.
Keyword [en]
Cellular automata, complex phenomena, genetic algorithms
Identifiers
URN: urn:nbn:se:kau:diva-17601OAI: oai:DiVA.org:kau-17601DiVA, id: diva2:591209
Available from: 2013-01-21 Created: 2013-01-21 Last updated: 2014-10-13

Open Access in DiVA

No full text in DiVA

Other links

http://www.cs.kau.se/cs/education/courses/davddiss/Uppsatser_2005/D2005-01.pdf

Authority records BETA

Andersson, Kerstin

Search in DiVA

By author/editor
Andersson, Kerstin
By organisation
Department of Computer ScienceCentre for HumanIT

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 156 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf