7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About

About Turing Machine Quiz - Downlo…

English Get Started

Home Theory of Computation

Recursively Enumerable Sets, Turing Machines and Undecidability Download Problems About…
Undecidability Problems About Turing Machine

Problems About Turing Machine MCQ Quiz - Objective Question with Answer for
Problems About Turing Machine - Download Free PDF

Last updated on Apr 14, 2024

Latest Problems About Turing Machine MCQ Objective Questions

Problems About Turing Machine Question 1:

Consider the following statements:

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
language.

S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is
undecidable.

Which of the statements is (are) correct?

1. Only S1

2. Only S2

3. Both S1 and S2

4. Neither S1 and S2

Answer (Detailed Solution Below)

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 1/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

Option 3 : Both S1 and S2

English Get Started

India's Super Teachers for all

govt. exams Under One Roof
FREE Demo Classes Available*

Enroll For Free Now

Problems About Turing Machine Question 1 Detailed Solution

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
language.

Equivalence problem for recursive enumerable language is undecidable which means there does not
exist any algorithm to decide if two Turing machine accept the same language or not. If it were
decidable, there will be algorithm to decide the acceptance of a string by a Turing machine and
problem of whether the language accepted by Turing machine is empty.

S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is undecidable.

It is correct. Subset problem for Turing machine is undecidable. There can exists a problem which is
accepted by Turing machine M2 but not by Turing machine M1. The problem to determine L(M1) ⊆
L(M2) is undecidable.

EE
FR
India’s #1 Learning Platform Trusted by 5.8 Crore+ Students

Start Complete Exam Preparation

Daily Live Practice Question Mock Tests &

MasterClasses Bank Quizzes

Get Started for Free

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 2/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

Problems About Turing Machine Question 2:

English Get Started

The Halting problem of Turing machines is

1. recursive

2. recursively enumerable but not recursive

3. recursive but not recursively enumerable

4. not recursively enumerable

Answer (Detailed Solution Below)

Option 2 :

recursively enumerable but not recursive

Problems About Turing Machine Question 2 Detailed Solution

The halting problem is undecidable over Turing machines.

The halting problem is recursively enumerable but not recursive. we can run the Turing Machine
and accept if the machine halts, hence it is recursively enumerable.

Important Point:

A recursively enumerable language is a language for which there exists a total Turing machine that
accepts it. It may or may not halt for input strings w. if it accepts a string it will halt (enter into the
final state) and if it does not accept a string it may or may not enter reject state(will loop infinitely
).
It is also known as a semi-decidable or partially decidable or Turing recognizable or Turing
acceptable language.

EE
FR
India’s #1 Learning Platform Trusted by 5.8 Crore+ Students

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 3/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

Start Complete Exam Preparation

English Get Started
Daily Live Practice Question Mock Tests &
MasterClasses Bank Quizzes

Get Started for Free

Top Problems About Turing Machine MCQ Objective Questions

Problems About Turing Machine Question 3 Download Solution PDF

Consider the following statements:

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
language.

S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is
undecidable.

Which of the statements is (are) correct?

1. Only S1

2. Only S2

3. Both S1 and S2

4. Neither S1 and S2

Answer (Detailed Solution Below)

Option 3 : Both S1 and S2

Problems About Turing Machine Question 3 Detailed Solution Download Solution PDF

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 4/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
English Get Started
language.

Equivalence problem for recursive enumerable language is undecidable which means there does not
exist any algorithm to decide if two Turing machine accept the same language or not. If it were
decidable, there will be algorithm to decide the acceptance of a string by a Turing machine and
problem of whether the language accepted by Turing machine is empty.

Sign UpMNow
S2: Let 1 and&
M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is undecidable.
Daily Live Classes 250+ Test series Study Material & PDF
Get Free Access Now
It is correct.
Quizzes Subset
With Detailed problem
Analytics for Turing
machine is undecidable. There can exists a problem which is
+ More Benefits
accepted by Turing machine M2 but not by Turing machine M1. The problem to determine L(M1) ⊆
L(M2) is undecidable.

Download Solution PDF Share on Whatsapp

EE
FR
Trusted by 5.8 Crore+ Students
India’s #1 Learning Platform

Start Complete Exam Preparation

Daily Live Practice Question Mock Tests &

MasterClasses Bank Quizzes

Get Started for Free

Problems About Turing Machine Question 4:

The Halting problem of Turing machines is

1. recursive

2. recursively enumerable but not recursive

3. recursive but not recursively enumerable

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 5/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

English Get Started

4. not recursively enumerable

Answer (Detailed Solution Below)

Option 2 :

recursively enumerable but not recursive

Problems About Turing Machine Question 4 Detailed Solution

The halting problem is undecidable over Turing machines.

The halting problem is recursively enumerable but not recursive. we can run the Turing Machine
and accept if the machine halts, hence it is recursively enumerable.

Important Point:

A recursively enumerable language is a language for which there exists a total Turing machine that
accepts it. It may or may not halt for input strings w. if it accepts a string it will halt (enter into the
final state) and if it does not accept a string it may or may not enter reject state(will loop infinitely
).
It is also known as a semi-decidable or partially decidable or Turing recognizable or Turing
acceptable language.

EE
FR
Trusted by 5.8 Crore+ Students
India’s #1 Learning Platform

Start Complete Exam Preparation

Daily Live Practice Question Mock Tests &

MasterClasses Bank Quizzes

Get Started for Free

Problems About Turing Machine Question 5:

Consider the following statements:

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
language.
https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 6/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is
English Get Started
undecidable.

Which of the statements is (are) correct?

1. Only S1

2. Only S2

3. Both S1 and S2

4. Neither S1 and S2

Answer (Detailed Solution Below)

Option 3 : Both S1 and S2

Problems About Turing Machine Question 5 Detailed Solution

S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
language.

Equivalence problem for recursive enumerable language is undecidable which means there does not
exist any algorithm to decide if two Turing machine accept the same language or not. If it were
decidable, there will be algorithm to decide the acceptance of a string by a Turing machine and
problem of whether the language accepted by Turing machine is empty.

S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is undecidable.

It is correct. Subset problem for Turing machine is undecidable. There can exists a problem which is
accepted by Turing machine M2 but not by Turing machine M1. The problem to determine L(M1) ⊆
L(M2) is undecidable.

EE
FR
Trusted by 5.8 Crore+ Students
India’s #1 Learning Platform

Start Complete Exam Preparation

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 7/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

Daily Live Practice Question Mock Tests &

MasterClasses Bank Quizzes English Get Started

Get Started for Free

Problems About Turing Machine Question 6:

Let be the encoding of a Turing machine that accepts a string over inputs {0, 1}. Let L = {/ M
is a Turing machine that accepts a string which is a palindrome}. L is _______.

1. Decidable and recursively enumerable

2. Undecidable and recursively enumerable

3. Decidable but not recursively enumerable

4. Undecidable but not recursively enumerable

Answer (Detailed Solution Below)

Option 2 : Undecidable and recursively enumerable

Problems About Turing Machine Question 6 Detailed Solution

The membership problem of a Turing machine is undecidable. Therefore, L is undecidable.

Also, the given language is context free language, hence, recursively enumerable as well.

Therefore, option 2 is correct.

EE
FR
Trusted by 5.8 Crore+ Students
India’s #1 Learning Platform

Start Complete Exam Preparation

Daily Live Practice Question Mock Tests &

MasterClasses Bank Quizzes

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 8/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

Get Started for Free

English Get Started

Problems About Turing Machine Question 7:

Consider the following statements:

(i). There exists a Turing machine that enumerates a set S of (encodings of) decider Turing machines,
such that S includes Turing machines that decide infinitely many different decidable languages.

(ii). If L1 is decidable language and L2 is Turing recognizable language, then L1 - L2 must be Turing
recognizable.

(iii). If L1 is decidable language and L2 is Turing recognizable language, then L1L2 must be Turing
recognizable.

Which of the above statement/s is/are TRUE?

1. (i) only

2. (i) and (ii) only

3. (ii) and (iii) only

4. (i) and (iii) only

Answer (Detailed Solution Below)

Option 4 : (i) and (iii) only

Problems About Turing Machine Question 7 Detailed Solution

(i). True: There exists a Turing machine that enumerates a set S of (encodings of) decider Turing
machines, such that S includes Turing machines that decide infinitely many different decidable
languages.

(ii). False: Assume L1 is Σ∗, then L1 - L2 will not be Turing recognizable if L2 is not decidable because RE
languages are not closed under complementation.

(iii). True: Turing recognizable problems are closed under concatenation.

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 9/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

EE
FR English Get Started
Trusted by 5.8 Crore+ Students
India’s #1 Learning Platform

Start Complete Exam Preparation

Daily Live Practice Question Mock Tests &

MasterClasses Bank Quizzes

Get Started for Free

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 10/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

English Get Started

Exams

SSC CGL 2024 SSC JE 2024 IBPS PO 2024 SBI Clerk 2024
SSC MTS 2024 SSC Selection Post 2024 IBPS Clerk 2024 RRB ALP 2024
SSC CPO 2024 IBPS RRB Clerk 2024 IBPS SO 2024 RRB JE 2024
SSC CHSL 2024 IBPS RRB PO 2024 SBI PO 2024 RRB NTPC 2024

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 11/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

RRB Group D 2024 CTET 2024 SSC Stenographer 2024 EMRS TGT
RRB Technician 2024 RBI Grade B 2024 English
AIIMS Nursing Officer 2024 EMRS PGTGet Started
RPF Constable 2024 RBI Assistant 2024 RRB Staff Nurse 2024 SSC MTS & Havaldar
RPF SI 2024 SEBI Grade A 2024 DSSSB PGT Bihar Secondary Teacher
UPSC IAS 2024 Indian Airforce Agniveer Chandigarh Police Bihar Senior Secondary
UPSC NDA 2024 2024 Constable Teacher
UPSC CDS 2024 Indian Army Agniveer 2024 DFCCIL Executive UTET
UPSC CAPF AC 2024 UPSSSC VDO 2024 Bihar Primary Teacher
UGC NET 2024 AFCAT 2024 Haryana CET Group D
CSIR NET 2024 SSC GD Constable 2024 RBI Grade B Exam
Test Series

CTET Mock Test TCS Mock Test CUET Maths Mock Test NABARD Development
CUET Mock Test CDS Mock Test SSC GD Constable Mock Assistant Mock Test
NEET Mock Test MP GK Mock Test Test MAH MBS CST Mock Test
JEE Main Mock Test TCS NQT Mock Test IBPS SC Mock Test UGC NET English Mock Test
SSC CHSL Mock Test IBPS RRB PO Mock Test ESIC SSO Mock Test CUET Political Science Mock
NDA Mock Test SSC Stenographer Mock Infosys Mock Test Test
IBPS PO Mock Test Test CUET Physics Mock Test FCI Manager Mock Test
IBPS Clerk Mock Test WB TET Mock Test Haryana CET Mock Test CUET Chemistry Mock Test
SBI PO Mock Test RBI Assistant Mock Test Indian Army GD Mock Test IB Security Assistant Mock
UGC NET Paper 1 Mock REET Test Series UPPCL Executive Assistant Test
Test RRB NTPC Mock Test Mock Test CSIR NET Life Science Mock
AFCAT Mock Test LIC ADO Mock Test ECGC PO Mock Test Test
RRB Group D Mock Test UGC NET Commerce Mock NIMCET Mock Test UTET Test Series
AMCAT Mock Test Test CUET Economics Mock Test
LIC AAO Mock Test CAT Exam Mock Test CUET History Mock Test

SuperCoaching

UPSC Coaching CDS Coaching JSSC JE Coaching SSC Selection Post

BPSC Coaching AFCAT Coaching EMRS TGT and PGT Coaching
SSC JE Electrical Coaching Haryana CET Group D Coaching UPSC CAPF AC Coaching
SSC JE Mechanical Coaching Bihar Police Constable RBI Assistant Coaching
Coaching DFCCIL Junior Executive Coaching EPFO SSA Coaching
SSC JE Civil Coaching Coaching SSC MTS Coaching UP Police constable
UGC NET Coaching DFCCIL Operations & BD SSC GD Coaching Coaching
CSIR NET Coaching Coaching SSC CHSL Coaching EMRS Accountant Coaching
CTET Coaching DFCCIL Executive Coaching Delhi Police Constable RPSC Assistant Professor
SSC Coaching Bihar Primary Teacher Coaching Political Science Coaching
Railway Coaching Coaching SSC IMD Coaching IBPS Clerk Coaching
Bank Exams Coaching Chandigarh Police SSC CGL Tier 2 Coaching MP Police Constable
NDA Coaching Constable Coaching Coaching

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 12/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

Previous Year Papers

English Get Started
UPSC CSE Previous Year SSC CHSL Previous Year Papers UPSC CAPF AC Previous
Papers Papers UP Police Constable Year Papers
SSC CGL Exam Previous SSC CPO Previous Year Previous Year Papers Indian Airforce Agniveer
Year Papers Papers UPSC CSAT Question Paper Previous Year Papers
UGC NET Previous Year UPSC NDA Previous Year Maharashtra Talathi OSSC CGL Previous Year
Papers Papers Previous Year Papers Papers
Delhi Police Constable CDS Previous Year Papers CSIR NET Previous Year EPFO SSA Previous Year
Previous Year Papers AFCAT Previous Year Papers Papers Papers
RRB Office Assistant MP Police Constable RBI GRADE B Previous Year UP Police SI Previous Year
Previous Year Papers Previous Year Papers Papers Papers
IBPS RRB PO Previous Year Chandigarh Police IBPS CLERK Previous Year SSC JE Previous Year Papers
Papers Constable Previous Year Papers SSC JE ME Previous Year
Bihar Police Constable Papers Bihar Police SI Previous Year Papers
Previous Year Papers DDA ASO Previous Year Papers SSC JE EE Previous Year
SSC MTS Previous Year Papers SSC Havaldar Previous Year Papers
Papers Maharashtra FOREST Papers SSSC JE CE Previous Year
GUARD Previous Year Papers

Latest Updates

RRB ALP Revised Vacancies OSSSC Forest Guard Result CTET Admit Card
TS SET Application Date Revised Answer Key RSMSSB Sanganak RRB ALP Revised Vacancies
Extended OPSC Assistant Fisheries RPSC Vidhi Rachnakar Exam RPSC RAS Final Marks
CSIR SO Stage 2 Admit Officer Exam Schedule City Information Notice HPPSC HPAS Mains Admit
Card UPSC CAPF AC Final Result SSC CPO Answer Key Card
CSIR ASO Stage 2 Admit OSSC Vital Statistics Select SGPGI Nursing Officer IOCL Apprentice Admit
Card List Exam Date Card
KTET Answer Key BPSC Assistant Architect KPSC KAS Exam Schedule OPSC Ayurvedic Officer
NFL MT Application Admit Card Notice UPPSC Assistant Town Admit Card
Extended Bihar Police Prohibition Sub Planner Answer Key UPSC IES Final Result
APPSC Group 2 Mains Inspector PET Admit Card WBJEE ANM GNM Admit
Postponed Bihar Teacher Admit Card Card
CTET Admit Card Rajasthan Pre D.El. Ed UPSC CMS Admit Card
TNPSC Group 1 Admit Card Answer Key CDS Marks
Odisha Livestock Inspector HPSC Assistant DSSSB Jail Warder Answer
Revised Answer Key Environmental Engineer Key

Skill Academy

Data Science with Python Business Analyst Course Full Stack Development
Course Digital Marketing Course Course

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 13/14
7/15/24, 12:59 AM Problems About Turing Machine MCQ [Free PDF] - Objective Question Answer for Problems About Turing Machine Quiz - Downlo…

MCQ Questions
English Get Started
JAVA MCQ Software Engineering MCQ Constitution of India MCQ Statistics MCQ
Python MCQ Software Testing MCQ Cost Accounting MCQ Geography MCQ
HTML MCQ Computer Fundamentals Project Management MCQ Chemistry MCQ
Javascript MCQ MCQ Engineering Mechanics Biology MCQ
MS Word MCQ Computer Graphics MCQ MCQ
Research Methodology Economy MCQ Determiners MCQ
MCQ Economics MCQ Agriculture MCQ

Testbook Products & Resources for Students

Daily Editorials for UPSC Plutus Education ACCA Syllabus & Exam Evaluate UPSC Mains
UPSC Mains Answer What is ACCA? Pattern Answer
Writing ACCA Eligibility

Company Products Our Apps

About us Test Series

Testbook App
Careers We are hiring Testbook Pass
Download now
Testbook Edu Solutions Pvt. Teach Online on Testbook Online Courses
Ltd. Partners Online Videos Current Affairs
Media Practice Download now
1st & 2nd Floor, Zion
Building, Sitemap Blog
Follow us on
Plot No. 273, Sector 10, Refer & Earn
Kharghar, Books
Navi Mumbai - 410210

[email protected]
Toll Free:
1800 833 0800
Office Hours: 10 AM to 7 PM
(all 7 days)

Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved User Policy Terms Privacy

https://testbook.com/objective-questions/mcq-on-problems-about-turing-machine--5eea6a1239140f30f369edbe 14/14