next up previous contents
Next: acceptance table Up: A non-r.e. language: Ld Previous: A non-r.e. language: Ld

definition of wi and Mj

Given two integers i and j, word wi is defined as the binary code for i and Mj as the TM who's code is the binary code for j. If j does not code for a valid TM, then it is considered to be a TM which accepts the empty set ($L(M) = \emptyset$).