self doubt

Question

L={ <M> | ‘M’ IS A TURING MACHINE AND ‘M’ COMPUTES THE PRODUCT OF TWO NUMBERS }

here what can we say about ‘L’?

Comments

@Satbir if it is product of specific two numbers then L is finite right.. if we give some other TM (which is not in L) and asking it compute the product of those two number may or maynot halt right.. In that case as well its undecidable

---

@Hemanth_13 

cant we say that as it is non monotonic property so undecidable ?

---

Because behavior of machine is given