Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Cellular Automata
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.ORCID-id: 0000-0001-6302-7006
2004 (Engelska)Ingår i: 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, s. 598-608Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
Karlstad: Karlstad University Press , 2004. Vol. 2004:26, s. 598-608
Serie
Karlstad University Studies, ISSN 1403-8099
Nyckelord [en]
Cellular automata
Nationell ämneskategori
Data- och informationsvetenskap
Forskningsämne
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-17599ISBN: 9185019933 (tryckt)OAI: oai:DiVA.org:kau-17599DiVA, id: diva2:591207
Konferens
Promote IT 2004, Karlstad, Sweden, May 5-7, 2004
Tillgänglig från: 2013-01-21 Skapad: 2013-01-21 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Personposter BETA

Andersson, Kerstin

Sök vidare i DiVA

Av författaren/redaktören
Andersson, Kerstin
Av organisationen
Avdelningen för datavetenskapCentrum för HumanIT
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 231 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf