Pages that link to "Item:Q5156795"
From MaRDI portal
The following pages link to Computable Følner monotilings and a theorem of Brudno (Q5156795):
Displaying 4 items.
- Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
- An announce of results linking Kolmogorov complexity to entropy for amenable group actions (Q2307955) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Fiber entropy and algorithmic complexity of random orbits (Q2676615) (← links)
