Problem:
Question 1: Show that any infinite set of MINTM is not Turing-recognizable.
Question 2: Show that if A\leqT B and B\leqT C then A\leqT C.
Question 3: Show that the set of incompressible strings is undecidable.
Please provide discription of all the questions.