Given a language:$A = \{ <M> | M\ rejects\ the\ string\ 101 \}$Can I prove it is undecidable using Rice's theorem?See like the theorem conditions are met (there exists non trivial language that describes the machine language )
Is a language of TMs undecidable using Rice's theorem
computability;turing machines