0 votes 0 votes Determine whether or not the following statements is true: Any problem whose domain is finite is decidable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 14, 2019 • retagged Mar 15, 2019 by Rishi yadav Rishi yadav 190 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.