Show that the language {(M1,M2): M1 and M2 are Turing machines with L(M1) is subset of...
Show that the language {(M1,M2): M1 and M2 are Turing machines with L(M1) is subset of L(M2) is undecidable
Homework Answers
According to Rice's Theorm, if you have a nontrivial set of languages, then the set of (codes of) TMs that accept these languages is not decidable. In this problem, however, we have pairs of languages. One trick is to specialize the problem to make it fit Rice's theorem by fixing M2. For example, fix some M2 such that L(M2) is empty. In this case, if SUBSETTM is decidable, then its subset with fixed M2 {<M1, M2> : M1 is a Turing machine and L(M1) is empty} is decidable as well. This, in turn, means that {<M> : M is a Turing machine and L(M1) is empty} is decidable.
Add Answer to:
Show that the language {(M1,M2): M1 and M2 are Turing machines
with L(M1) is subset of...
Let M1 and M2 be arbitrary Turing machines. Prove that the problem “L(M1 ) ⊆ (M2...
Let M1 and M2 be arbitrary Turing machines. Prove that the problem “L(M1 ) ⊆ (M2 ) ” is undecidable.
Use a Turing Reduction to show that the following language is undecidable. L={ | L(M) is...
Use a Turing Reduction to show that the following language is undecidable. L={ | L(M) is infinite}.
Show that the language A = {<M1> | the language accepted by the Turing Machine M1...
Show that the language A = {<M1> | the language
accepted by the Turing Machine M1 is 1*} is
not decidable. Present your proof in the style of the proof of Th.
5.3, which shows below.
PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
A Turing machine that halts on all inputs is called a halting Turing machine (also known...
A Turing machine that halts on all inputs is called a halting Turing machine (also known as Decider). Prove the following: (a) If M1 and M2 are two halting Turing machines, then there exists a halting Turing machine that recognizes L(M1) ∩ L(M2). (b) If M1 and M2 are two (not necessarily halting) Turing machines, then there exists a Turing machine that recognizes L(M1) ∩ L(M2).
Give transition diagrams for Standard Turing Machines that accept the following language L = {ww :...
Give transition diagrams for Standard Turing Machines that accept the following language L = {ww : w ∈ {a, b} ∗}
2. Let L = {hMi: M is a Turing machine that accepts at least two binary strings}. a) Define the notions of a recognisabl...
2. Let L = {hMi: M is a Turing machine that accepts at least two
binary strings}. a) Define the notions of a recognisable language
and an undecidable language. [5 marks] b) Is L Turing-recognisable?
Justify your answer with an informal argument. [5 marks] c) Prove
that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d)
Bonus: Justify with a formal proof your answer to b). [20
marks]
2. Let L-M M): M is a Turing machine that accepts...
Help me answer this question plz! 4. Let L = { (A) M is a Turing...
Help me answer this question plz!
4. Let L = { (A) M is a Turing machine that accepts more than one string } a) Define the notions of Turing-recognisable language and undecidable language. b) Is L Turing-recognisable? Justify your answer with an informal argument. c) Justify with a formal proof your answer to b) d) Prove that L is undecidable. (Hint: use Rice's theorem.) e) Modify your answer to b) when instead of L you have the language Ln...
Let Show that L is undecidable L = {〈M) IM is a Turing Machine that accepts w whenever it accepts L = {〈M) IM is a Turing Machine that accepts w whenever it accepts
Let Show that L is undecidable L = {〈M) IM is a Turing Machine that accepts w whenever it accepts L = {〈M) IM is a Turing Machine that accepts w whenever it accepts
please solve the problems(True/False questions) 25. There is a problem solvable by Turing machines with two...
please solve the problems(True/False questions)
25. There is a problem solvable by Turing machines with two tapes but unsolvable by Turing machines with a single tape 26. The language L = {(M, w) | M halts on input w} is recursively enumerable 27. The language L = {(M,w) | M halts on input w is recursive ne language L = {a"o"c" | n 2 1} in linear time 24. Nondeterministic Turing machines have the same expres siveness as the standard...
3. Let L= {MM is a Turing machine and L(M) is empty), where L(M) is the...
3. Let L= {MM is a Turing machine and L(M) is empty), where L(M) is the language accepted by M. Prove L is undecidable by finding a reduction from Arm to it, where Arm={<M,w>| M is a Turing machine and M accepts w}
Show that the language A = {<M1> | the language
accepted by the Turing Machine M1 is 1*} is
not decidable. Present your proof in the style of the proof of Th.
5.3, which shows below.
PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
2. Let L = {hMi: M is a Turing machine that accepts at least two
binary strings}. a) Define the notions of a recognisable language
and an undecidable language. [5 marks] b) Is L Turing-recognisable?
Justify your answer with an informal argument. [5 marks] c) Prove
that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d)
Bonus: Justify with a formal proof your answer to b). [20
marks]
2. Let L-M M): M is a Turing machine that accepts...
Help me answer this question plz!
4. Let L = { (A) M is a Turing machine that accepts more than one string } a) Define the notions of Turing-recognisable language and undecidable language. b) Is L Turing-recognisable? Justify your answer with an informal argument. c) Justify with a formal proof your answer to b) d) Prove that L is undecidable. (Hint: use Rice's theorem.) e) Modify your answer to b) when instead of L you have the language Ln...
please solve the problems(True/False questions)
25. There is a problem solvable by Turing machines with two tapes but unsolvable by Turing machines with a single tape 26. The language L = {(M, w) | M halts on input w} is recursively enumerable 27. The language L = {(M,w) | M halts on input w is recursive ne language L = {a"o"c" | n 2 1} in linear time 24. Nondeterministic Turing machines have the same expres siveness as the standard...
3. Let L= {MM is a Turing machine and L(M) is empty), where L(M) is the language accepted by M. Prove L is undecidable by finding a reduction from Arm to it, where Arm={<M,w>| M is a Turing machine and M accepts w}
Most questions answered within 3 hours.
-
Brooke and Georgia are neighbors. Each have 40 hours per week.
Brooke needs 5 hours to...
asked 2 minutes ago -
Quantitative Problem: You are holding a
portfolio with the following investments and betas:
Stock
Dollar investment...
asked 45 seconds from now -
Within the costing system of a manufacturing company the
following types of expenses were incurred:
Details...
asked 1 minute ago -
Data from the Bureau of Labor Statistics’ Consumer Expenditure
Survey show that annual expenditures for cellular...
asked 17 minutes ago -
Consider the following MIPS code:
add $t3,$t2,$t1
lw $t4,0($t3)
sw $t7,0($t3)
add $t6,$t2,$t8
addi $t3,$t5,4
(a)...
asked 13 minutes ago -
Assembly Language:
Is it TRUE or FALSE:
Reduced Instruction Set Computers (RISC) are characterized
by:
Relatively...
asked 17 minutes ago -
A ball is thrown from the origo over a flat horizontal ground.
the x-axis is
horizontal...
asked 20 minutes ago -
Discuss graph representation, Breadth-first search and
Depth-first search. Use examples to highlight pros and
cons.
asked 26 minutes ago -
what are the impacts of droughts in east Africa on the:
1) economy:
2) agriculture:
3)...
asked 28 minutes ago -
Fleas can jump quite high; experiments show that they can reach
an altitude of 120 times...
asked 34 minutes ago -
The rate constant for this first-order reaction is 0.0520 s–1 at
400 °C.
A----> Product
After...
asked 40 minutes ago -
boolean a = ( true && false );
System.out.println( a );
what is the output of...
asked 44 minutes ago