Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox (Q509196): Difference between revisions
From MaRDI portal
Latest revision as of 09:25, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox |
scientific article |
Statements
Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox (English)
0 references
9 February 2017
0 references
topological entropy
0 references
kneading sequences
0 references
chaos
0 references
Parrondo's paradox
0 references
0 references
