Local cellular automata as an abstract model of self-organizing process

Taichi Haruna, Yukio Gunji

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we concern an abstract model of self-organizing process called local cellular automata (LCA) proposed by us recently. The circular organization of living systems is addressed. A consistent circularity is defined by a closure operation on complete lattice. An inconsistent circularity is defined by a quasi-closure called weak closure implied by an internal perspective. Each cell in a LCA receives data about the time developments of its neighbors at one step before. It constructs a (in general incomplete) look-up table by taking closure (or weak closure) of the received data on an appropriate lattice. It applies obtained rule to its own present state and changes the state. In the former half of the paper, the theory which is the basis for LCA based on set lattice is reformulated in terms of complete lattice. In the latter half, we restrict cells' information receiving ability and define restricted local cellular automata (RLCA). The space-time patterns of RLCA are estimated by the variance of input-entropy over a span of time steps. The difference between closure driven RLCA and weak closure driven RLCA is discussed.

Original languageEnglish
Title of host publicationAIP Conference Proceedings
Pages371-380
Number of pages10
Volume839
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventCOMPUTING ANTICIPATORY SYSTEMS - CASYS'05: Seventh International Conference on Computing Anticipatory Systems - Liege
Duration: 2005 Aug 82005 Aug 13

Other

OtherCOMPUTING ANTICIPATORY SYSTEMS - CASYS'05: Seventh International Conference on Computing Anticipatory Systems
CityLiege
Period05/8/805/8/13

Fingerprint

organizing
cellular automata
closures
cells
entropy

Keywords

  • Cellular automata
  • Closure
  • Complete lattice
  • Self-organization
  • Variance of input-entropy

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Local cellular automata as an abstract model of self-organizing process. / Haruna, Taichi; Gunji, Yukio.

AIP Conference Proceedings. Vol. 839 2006. p. 371-380.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Haruna, T & Gunji, Y 2006, Local cellular automata as an abstract model of self-organizing process. in AIP Conference Proceedings. vol. 839, pp. 371-380, COMPUTING ANTICIPATORY SYSTEMS - CASYS'05: Seventh International Conference on Computing Anticipatory Systems, Liege, 05/8/8. https://doi.org/10.1063/1.2216647
Haruna, Taichi ; Gunji, Yukio. / Local cellular automata as an abstract model of self-organizing process. AIP Conference Proceedings. Vol. 839 2006. pp. 371-380
@inproceedings{5ceb3e036f2e4be786273ba3cad9eec0,
title = "Local cellular automata as an abstract model of self-organizing process",
abstract = "In this paper we concern an abstract model of self-organizing process called local cellular automata (LCA) proposed by us recently. The circular organization of living systems is addressed. A consistent circularity is defined by a closure operation on complete lattice. An inconsistent circularity is defined by a quasi-closure called weak closure implied by an internal perspective. Each cell in a LCA receives data about the time developments of its neighbors at one step before. It constructs a (in general incomplete) look-up table by taking closure (or weak closure) of the received data on an appropriate lattice. It applies obtained rule to its own present state and changes the state. In the former half of the paper, the theory which is the basis for LCA based on set lattice is reformulated in terms of complete lattice. In the latter half, we restrict cells' information receiving ability and define restricted local cellular automata (RLCA). The space-time patterns of RLCA are estimated by the variance of input-entropy over a span of time steps. The difference between closure driven RLCA and weak closure driven RLCA is discussed.",
keywords = "Cellular automata, Closure, Complete lattice, Self-organization, Variance of input-entropy",
author = "Taichi Haruna and Yukio Gunji",
year = "2006",
doi = "10.1063/1.2216647",
language = "English",
isbn = "0735403317",
volume = "839",
pages = "371--380",
booktitle = "AIP Conference Proceedings",

}

TY - GEN

T1 - Local cellular automata as an abstract model of self-organizing process

AU - Haruna, Taichi

AU - Gunji, Yukio

PY - 2006

Y1 - 2006

N2 - In this paper we concern an abstract model of self-organizing process called local cellular automata (LCA) proposed by us recently. The circular organization of living systems is addressed. A consistent circularity is defined by a closure operation on complete lattice. An inconsistent circularity is defined by a quasi-closure called weak closure implied by an internal perspective. Each cell in a LCA receives data about the time developments of its neighbors at one step before. It constructs a (in general incomplete) look-up table by taking closure (or weak closure) of the received data on an appropriate lattice. It applies obtained rule to its own present state and changes the state. In the former half of the paper, the theory which is the basis for LCA based on set lattice is reformulated in terms of complete lattice. In the latter half, we restrict cells' information receiving ability and define restricted local cellular automata (RLCA). The space-time patterns of RLCA are estimated by the variance of input-entropy over a span of time steps. The difference between closure driven RLCA and weak closure driven RLCA is discussed.

AB - In this paper we concern an abstract model of self-organizing process called local cellular automata (LCA) proposed by us recently. The circular organization of living systems is addressed. A consistent circularity is defined by a closure operation on complete lattice. An inconsistent circularity is defined by a quasi-closure called weak closure implied by an internal perspective. Each cell in a LCA receives data about the time developments of its neighbors at one step before. It constructs a (in general incomplete) look-up table by taking closure (or weak closure) of the received data on an appropriate lattice. It applies obtained rule to its own present state and changes the state. In the former half of the paper, the theory which is the basis for LCA based on set lattice is reformulated in terms of complete lattice. In the latter half, we restrict cells' information receiving ability and define restricted local cellular automata (RLCA). The space-time patterns of RLCA are estimated by the variance of input-entropy over a span of time steps. The difference between closure driven RLCA and weak closure driven RLCA is discussed.

KW - Cellular automata

KW - Closure

KW - Complete lattice

KW - Self-organization

KW - Variance of input-entropy

UR - http://www.scopus.com/inward/record.url?scp=33846028550&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846028550&partnerID=8YFLogxK

U2 - 10.1063/1.2216647

DO - 10.1063/1.2216647

M3 - Conference contribution

SN - 0735403317

SN - 9780735403314

VL - 839

SP - 371

EP - 380

BT - AIP Conference Proceedings

ER -