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
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
2004 (English)In: Promote IT 2004: proceedings of the fourth Conference for the Promotion of Research in IT at New Universities and University Colleges in Sweden : 5-7 May, 2004, Karlstad University, Sweden. P. 1 / [ed] Bubenko, Janis, Karlstad: Karlstad University Press , 2004, Vol. 2004:26, p. 598-608Conference paper, Published paper (Refereed)
Abstract [en]

In this paper properties and behavior of cellular automata are considered. Cellular automata can simply be described as lattices of cells, where the cells can be in a finite number of states. By using simple rules the states of the cells are updated in parallel at discrete time steps. Depending on the rule and, to a certain degree, the initial states of the cells, the evolution of a cellular automaton is restricted to a small number a ways. Some cellular automata evolve uniformly, meaning that all cells end up in the same state, while others evolve randomly, meaning that the states of the cells appear to be totally randomized during evolution. Intermediate behavior, displaying repetitiveness or nesting, also occurs.Properties of cellular automata that are discussed in the paper are, for instance, sensitivity to initial conditions, randomness, reversibility, entropy, and conservation. These properties also appear in the physical world and cellular automata provide good examples in the understanding of these properties.The evolution of cellular automata can be used for computations. Some cellular automata even display the property of universality, a term well known from the universal Turing machine, meaning that there is no limit to the sophistication of the computations they can perform.

Place, publisher, year, edition, pages
Karlstad: Karlstad University Press , 2004. Vol. 2004:26, p. 598-608
Series
Karlstad University Studies, ISSN 1403-8099
Keywords [en]
Cellular automata
National Category
Computer and Information Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-17599ISBN: 9185019933 (print)OAI: oai:DiVA.org:kau-17599DiVA, id: diva2:591207
Conference
Promote IT 2004, Karlstad, Sweden, May 5-7, 2004
Available from: 2013-01-21 Created: 2013-01-21 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Andersson, Kerstin

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 179 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