edited by
223 views
0 votes
0 votes

Tell whether each of the following are recursive, RE-but-not-recursive, or non-RE.

  1. The set of all $TM$ codes for $TM's$ that halt on every input.
  2. The set of all $TM$ codes for $TM’s$ that halt on no input.
  3. The set of all $TM$ codes for $TM's$ that halt on at least one input.
  4. The set of all $TM$ codes for $TM's$ that fail to halt on at least one input.  
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2