Unformatted text preview: T such that L( T ) = L i . 2. Let T 1 , T 2 , T 3 , … , T n , … be a constructive enumeration of all Turing machines with alphabet {1, 0} and one linear tape. For each of the following sets X 1 = { p ; p is a prime number }, X 2 = { px ; p is a fixed prime number and x is a number of a Turing machine T x that halts given the input x }, X 3 = { x ; x is a number of a Turing machine T x that does not halt given the input x }, find if it is: a) decidable/recursive; b) recursively enumerable; c) inductively decidable....
View
Full Document
 Spring '09
 Bulogi
 Prime number, Formal language, Turing Machines, Formal languages, Contextfree grammar, Turing machine Tx

Click to edit the document details