Skip to main content
1 of 7

Self-similarity in the theory of computability

Let $M = w_0w_1... \in \{0,1\}^*$. For any computable function $f$ define $M_f = w_{f(0)}w_{f(1)}...$

Let for any computable function $f$ there is computable mapping between $M_f$ and $M$ (we can reestablish $M$ by its any computable subsequence)

Is it possible that $M$ is non-computable?