next up previous
Next: TURING MACHINE Up: No Title Previous: No Title

DEFINITIONS

Examples of some languages
  1. tex2html_wrap_inline645
  2. tex2html_wrap_inline647
  3. tex2html_wrap_inline651
  4. tex2html_wrap_inline653
  5. tex2html_wrap_inline655 tex2html_wrap_inline657
  6. tex2html_wrap_inline659 is prime} r.e. language
    recursive.
  7. {<M,w> | <M,w> is an encoding of a Turing Machine M and its input w}
    Recursively Enumerable but not Recursive

Sushil Prasad
Thu Jul 30 13:41:04 EDT 1998