Prove the language by construction L = {< M > |M is a TM, M takes less than 3 steps when running on < M >} is Turing dec
Posted: Fri Jul 01, 2022 5:43 am
Prove the language by construction L = {< M > |M is a TM,M takes less than 3 steps when running on < M >} is Turingdecidable.