The Gateway to Computer Science Excellence

0 votes

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

- The set of all $TM$ codes for $TM's$ that halt on every input.
- The set of all $TM$ codes for $TM’s$ that halt on no input.
- The set of all $TM$ codes for $TM's$ that halt on at least one input.
- The set of all $TM$ codes for $TM's$ that fail to halt on at least one input.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.6k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,832 questions

57,686 answers

199,271 comments

107,196 users