** Next:** The language L_{d} is
** Up:** A non-r.e. language: L_{d}
** Previous:** definition of w_{i} and M_{j}

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.

*root*

*6/10/1998*