0 votes 0 votes which is/are TRUE: 1)All recursive lang are decidable problems? 2)All decidable problems are recursive language? - is both of them are true? any proof please? Theory of Computation decidability + – pps121 asked Dec 8, 2018 pps121 195 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.