Abstract

In this paper, we prove that given any Π^0_1 subset PP of $\{0,1\}^\NN$ there is a tileset ττ with a set of configurations CC such that $P\times\ZZ^2$ is recursively homeomorphic to C∖UC\setminus U where UU is a computable set of configurations. As a consequence, if PP is countable, this tileset has the exact same set of Turing degrees.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.