Prove a language $A_{PTM}$ is not BPP-Complete
To show that a language is not BPP-complete, it suffices to do one of the following:


Show that the language is not in BPP.
Show that the language is not BPP-hard.


Your language seems to be undecidable, and so in particular, not in BPP.