Pages that link to "Item:Q2354582"
From MaRDI portal
The following pages link to Symbolic dynamics: entropy = dimension = complexity (Q2354582):
Displaying 14 items.
- Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts (Q515582) (← links)
- A note on dimensional entropy for amenable group actions (Q1668830) (← links)
- Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
- Effective Hausdorff dimension in general metric spaces (Q1787953) (← links)
- Complexity of shift spaces on semigroups (Q2025122) (← links)
- Mean dimension theory in symbolic dynamics for finitely generated amenable groups (Q2158210) (← links)
- Constant length substitutions, iterated function systems and amorphic complexity (Q2193049) (← links)
- An announce of results linking Kolmogorov complexity to entropy for amenable group actions (Q2307955) (← links)
- Fiber entropy and algorithmic complexity of random orbits (Q2676615) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (Q4579816) (← links)
- Computable Følner monotilings and a theorem of Brudno (Q5156795) (← links)
- ON ENTROPIES AND COMPLEXITY FOR AMENABLE ACTIONS GROUPS (Q5213067) (← links)
- An entropy formula over the dynamical balls and its applications (Q5869784) (← links)