2 votes 2 votes Theory of Computation mit + – 2018 asked Dec 16, 2016 2018 485 views answer comment Share Follow See 1 comment See all 1 1 comment reply Gate Mission 1 commented Dec 16, 2016 reply Follow Share 1st is non trivial as there exist such TM's which have more than 37 states and more than 37 tape symbols and for a property to be decidable every tm should satisfy that property. 2nd is trivial as consider TM's that have less than 37 states..we can add extra dummy state to make it atleast 37 and similiarly if tape symbols are less than 37 then we can add extra symbols to make it count atleast 37..Hence all TM's satisfy second property. @Arjun Sir please verify me. 1 votes 1 votes Please log in or register to add a comment.