Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
1 answer
544 views

Is the set of cube-free binary sequences perfect?

This question is inspired by this one. In that thread, it's established that there are uncountably many cube-free infinite binary strings (where $x \in 2^{\omega}$ is cube-free iff $\forall \sigma \...
Amit Kumar Gupta's user avatar
10 votes
2 answers
1k views

Decidability of periodic tilings of the plane

I'm interested in tilings of the plane by squares, with labels on the edges. It's well known that (1) the question "can one tile the plane with the following finite set of tiles?" is undecidable, and (...
grok's user avatar
  • 2,519
6 votes
0 answers
136 views

Difficulty of homeomorphism of effective Cantor dynamics

Let $X = \{0,1\}^{\mathbb{N}}$ with the product topology. Given a Turing machine $M$ and $x \in X$, define $M(x) \in \{0,1\}^* \cup X$ as the sequence of bits output by $M$ when given an oracle for $x$...
Ville Salo's user avatar
  • 6,652