I was doing some exercises from computability and complexity and then I have stuck on this problem:
What type of problem (decidable, semi-decidable, undecidable) is the problem (show it):
Do given Turing Machines M, N accepts equinumerous languages?
- Answer this question without using Rice theorem.
I know what equinumerous means and I know basics about Turing Machines, however I totally don't have idea how to do this exercise or even how to start it. I will be very thankful for every help.