0 votes 0 votes Show that the Cartesian product of a finite number of countable sets is countable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine proof + – Rishi yadav asked Apr 2, 2019 Rishi yadav 127 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.