The Gateway to Computer Science Excellence
0 votes
18 views

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.  
in Theory of Computation by Veteran (55k points) | 18 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,586 answers
195,788 comments
101,839 users