效绵鼎 Proof-Concluded We have a contradiction:x is neither in L nor not in L,so our sole assumption (that there was an enumeration of the languages)is wrong Comment:This is really bad;there are more languages than TM. E.g.,there are languages that are not recognized by any Turing machine. .1515 Proof – Concluded ◼ We have a contradiction: x is neither in L nor not in L, so our sole assumption (that there was an enumeration of the languages) is wrong. ◼ Comment: This is really bad; there are more languages than TM. ◼ E.g., there are languages that are not recognized by any Turing machine