acceptance table

Imagine i and j are arranged in an infinite table, where the entries in the table are boolean values indicating the acceptance of word w_i by TM M_j. The diagonal of this table (i=j) are the entries for which the binary code of w_i and M_j are the same. The language L_d is defined as those w_i for which the (i,i) table entry is 0 (false), i.e L_d contains only those strings which do not code for TMs accepting themselves.