$$ L=\{<M>|M\ is\ a\ TM\ ;\ x,|x|<5 ;\ M\ rejects\ x\} $$How can i prove that $L \notin R$?I can't see how Rice's theorem be used here since the conditions are not met (The constrain $M\ rejects\ x$ is about the machine architecture and cannot be expreseed by a non-trivial language)
Determine if a language is decidable
computability;turing machines