Prove that languages exist that are not recognizable by an oracle Turing machine with oracle for ATM.
In Corollary 4.15 we showed that the set of all languages isuncountable. Use this result to prove that languages exist that are not recognizable by n oracle Turing machine with oracle for ATM.