0 votes 0 votes Show that every infinite Turing-recognizable language has an infinite decidable subset. Theory of Computation michael-sipser theory-of-computation turing-machine recursive-and-recursively-enumerable-languages proof + – admin asked Oct 15, 2019 admin 190 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.