Abstract
In this paper, we prove that given any Π^0_1 subset of $\{0,1\}^\NN$ there is a tileset with a set of configurations such that $P\times\ZZ^2$ is recursively homeomorphic to where is a computable set of configurations. As a consequence, if is countable, this tileset has the exact same set of Turing degrees.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.