Entropy of additive cellular automata (Q582910): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5737099 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3208805 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toward a quantitative theory of self-generated complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic properties of cellular automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some remarks about the ''efficiency'' of polyautomata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Entropy of additive cellular automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Statistical mechanics of cellular automata / rank | |||
Normal rank | |||
Revision as of 11:56, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entropy of additive cellular automata |
scientific article |
Statements
Entropy of additive cellular automata (English)
0 references
1989
0 references
The purpose of this paper is to derive entropy formulas for al nearest neighbor additive cellular automata defined over \({\mathbb{Z}}_ p\), where p is prime, to indicate which finite automata do and which do not decrease entropy, and to explain the reason that infinite automata do not decrease entropy.
0 references
entropy
0 references
cellular automata
0 references
