2012
DOI: 10.1016/j.ins.2012.04.016
|View full text |Cite
|
Sign up to set email alerts
|

Local measures of information storage in complex distributed computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
287
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 152 publications
(290 citation statements)
references
References 33 publications
3
287
0
Order By: Relevance
“…The framework of local information dynamics [17][18][19][20][21] studies how information is intrinsically processed within a system while it is "computing" its new state. Specifically, the information dynamics framework measures how information is stored, transferred and modified within a system during such a computational process.…”
Section: Information Dynamicsmentioning
confidence: 99%
See 2 more Smart Citations
“…The framework of local information dynamics [17][18][19][20][21] studies how information is intrinsically processed within a system while it is "computing" its new state. Specifically, the information dynamics framework measures how information is stored, transferred and modified within a system during such a computational process.…”
Section: Information Dynamicsmentioning
confidence: 99%
“…Information storage is defined as "the amount of information in [an agent's] past that is relevant to predicting its future" while the local active information storage [19] is the local mutual information between an agent's next state (x n+1 ) and its semi-infinite past x (k) n expressed as:…”
Section: Information Dynamicsmentioning
confidence: 99%
See 1 more Smart Citation
“…For a 2-agent, 1-step Markovian game, the total information from agent i's previous state space to i's next act is encoded in the sum of agent i's Transfer Entropy from agent −i's previous act to agent i's current act and agent i's "active memory" [31] of their own past acts: I(S i n : a i n+1 ) = T a −i →a i + I(a i n : a i n+1 ).…”
Section: Corollarymentioning
confidence: 99%
“…The higher the CE, the higher the complexity of the series is. CE and sE can be seen as portions of the decomposition of the overall amount of information carried by a series given that their sum is the Shannon entropy (ShE) [7][8][9][10]. While the CE is more widely utilized as a measure of complexity of a series [1][2][3], sE is traditionally exploited to assess regularity and predictability of a process [8] or information stored in it [7,9].…”
Section: Introductionmentioning
confidence: 99%