Computer Science – Discrete Mathematics
Scientific paper
2011-02-06
Computer Science
Discrete Mathematics
Scientific paper
In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$
there is a tileset $\tau$ with a set of configurations $C$ such that
$P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a
computable set of configurations. As a consequence, if $P$ is countable, this
tileset has the exact same set of Turing degrees.
Jeandel Emmanuel
Vanier Pascal
No associations
LandOfFree
Pi01 sets and tilings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Pi01 sets and tilings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pi01 sets and tilings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-506441