- #1
mathmari
Gold Member
MHB
- 5,049
- 7
Hey! ![Eek! :eek: :eek:](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
We have that the sets $S_1$ and $S_2$ are constructible enumerable, that means that there is Turing machine that enumerates them, right?
To show that the set $S_1 \cup S_2$ is also constructible enumerable, we construct a Tuiring machine that enumerates alternately one element of $S_1$ and one of $S_2$.
Is this correct?
How can we show that the cartesian product $S_1 \times S_2$ is also constructible enumerable?
We have that the sets $S_1$ and $S_2$ are constructible enumerable, that means that there is Turing machine that enumerates them, right?
To show that the set $S_1 \cup S_2$ is also constructible enumerable, we construct a Tuiring machine that enumerates alternately one element of $S_1$ and one of $S_2$.
Is this correct?
How can we show that the cartesian product $S_1 \times S_2$ is also constructible enumerable?