Let h(n) =1 if n codes a Turing machine M which halts when started on a...
Let h(n) =1 if n codes a Turing machine M which halts when started on a blank tape, h(n) =0 otherwise. Sketch a proof that h is not Turing computable.
Homework Answers
h is not turing compatable.why means everytime we will get the turing resukt as 1 only
if n=1 then turing give resulkt as h(1)=1 then turing give resukt as 1=1 o/p as 11=11
if n=2 then turing give resulkt as h(2)=1 then turing give resukt as 2=1 o/p as 111=11
if n=3 then turing give resulkt as h(3)=1 then turing give resukt as 3=1 o/p as 1111=11
if n=0 then turing give resulkt as h(0)=1 then turing give resukt as 0=1 o/p as 1=11
so evertime we will get output as 11 only at right side.so h(n)=0 is not turing compatable
Add Answer to:
Let h(n) =1 if n codes a Turing machine M which halts when
started on a...
2. (25 points) Consider the language Li = {(M)M is a Turing machine that halts when...
2. (25 points) Consider the language Li = {(M)M is a Turing machine that halts when started on the empty tape) Is Li є o? Justify your answer. ,
Rarisition written in the format of the Turing Machine simulator is a special state H which means...
rarisition written in the format of the Turing Machine simulator is a special state H which means halt. For the given Below is a Turing machine program where each line is a transition writen current state, read symbol, new state, write symbol, drection e-d. wmeans to state 4, write a 1 and move the tape head left. Notc there is a special state a os on the leftmost n nanks , write the resulting bitstring when the TM reaches the...
I. 40%) Find the output of the following Turing machine when run on the tape . . .6011006 ((S1,0)...
I. 40%) Find the output of the following Turing machine when run on the tape . . .6011006 ((S1,0), (0,S2,R)) ((S2,b),(0,S3,R)) ((S3,0), (0,S3,L)) Please indicate the final state and position of the read/write head on the tape when this TM halts.
I. 40%) Find the output of the following Turing machine when run on the tape . . .6011006 ((S1,0), (0,S2,R)) ((S2,b),(0,S3,R)) ((S3,0), (0,S3,L)) Please indicate the final state and position of the read/write head on the tape when this...
3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10 n + 4 steps the machine will be in state 3 with the tape reading: ...0(0111)"011100.... T...
3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10 n + 4 steps the machine will be in state 3 with the tape reading: ...0(0111)"011100.... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.
3. Use Mathematical Induction on n...
can someone help me with this problem? thanks Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101. Prove that there is n...
can someone help me with this problem? thanks
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
Turing Machines - Models of Language and Computation 8. (7 points) Consider the deterministic Turing machine M (s, t, h), includes fa, b, u) and possibly other symbols, H following rules, along with...
Turing Machines - Models of Language and Computation
8. (7 points) Consider the deterministic Turing machine M (s, t, h), includes fa, b, u) and possibly other symbols, H following rules, along with possibly other rules: (K, Σ, δ, s,H), where K (h), and includes the 6(s,凵) = (t,-) δ(t, a) = (t,-) 6(r,L) = (h, a) Here凵represents a blank. Suppose M is started in the configuration 凵aababaa in the start state with the read write head scanning the blank...
1L3 1L5 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10n +4 steps the machine will be in state 3 with the tape reading: 0(0111)"011100......
1L3 1L5 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10n +4 steps the machine will be in state 3 with the tape reading: 0(0111)"011100... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.
1L3 1L5 3. Use Mathematical Induction...
Design a DPDA M as a two-tape turing machine such that L(M) = {anbn : n>=0}
Design a DPDA M as a two-tape turing machine such that L(M) = {anbn : n>=0}
Give a high level description of a turing machine that performs binary addition. When started with...
Give a high level description of a turing machine that performs binary addition. When started with tape contents u#V where u and v are strings in {0,1}, it should halt with a single binary string on the tape, denoting the sum of the naturals denoted by u and v
0 1ORO 1RI 2 1R41R5 3 OR11L3 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank...
0 1ORO 1RI 2 1R41R5 3 OR11L3 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10n 4 steps the machine wil be in state 3 with the tape reading:001)"011100... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.
0 1ORO...
2. (25 points) Consider the language Li = {(M)M is a Turing machine that halts when started on the empty tape) Is Li є o? Justify your answer. ,
rarisition written in the format of the Turing Machine simulator is a special state H which means halt. For the given Below is a Turing machine program where each line is a transition writen current state, read symbol, new state, write symbol, drection e-d. wmeans to state 4, write a 1 and move the tape head left. Notc there is a special state a os on the leftmost n nanks , write the resulting bitstring when the TM reaches the...
I. 40%) Find the output of the following Turing machine when run on the tape . . .6011006 ((S1,0), (0,S2,R)) ((S2,b),(0,S3,R)) ((S3,0), (0,S3,L)) Please indicate the final state and position of the read/write head on the tape when this TM halts.
I. 40%) Find the output of the following Turing machine when run on the tape . . .6011006 ((S1,0), (0,S2,R)) ((S2,b),(0,S3,R)) ((S3,0), (0,S3,L)) Please indicate the final state and position of the read/write head on the tape when this...
3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10 n + 4 steps the machine will be in state 3 with the tape reading: ...0(0111)"011100.... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.
3. Use Mathematical Induction on n...
can someone help me with this problem? thanks
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
Turing Machines - Models of Language and Computation
8. (7 points) Consider the deterministic Turing machine M (s, t, h), includes fa, b, u) and possibly other symbols, H following rules, along with possibly other rules: (K, Σ, δ, s,H), where K (h), and includes the 6(s,凵) = (t,-) δ(t, a) = (t,-) 6(r,L) = (h, a) Here凵represents a blank. Suppose M is started in the configuration 凵aababaa in the start state with the read write head scanning the blank...
1L3 1L5 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10n +4 steps the machine will be in state 3 with the tape reading: 0(0111)"011100... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.
1L3 1L5 3. Use Mathematical Induction...
0 1ORO 1RI 2 1R41R5 3 OR11L3 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10n 4 steps the machine wil be in state 3 with the tape reading:001)"011100... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.
0 1ORO...
Most questions answered within 3 hours.
-
Problem #5
A communications cable is 2.00 km long and consists of two
parallel wires separated...
asked 4 minutes ago -
Cranium, Inc., purchases term papers from an overseas supplier
under a continuous review system. The average...
asked 3 hours ago -
1- What is the freezing point of pure water (in degrees
Celsius)?
2-
he molar mass...
asked 4 hours ago -
Determine the direction of the force that will act on the charge
in each of the...
asked 4 hours ago -
You purchase your daily coffee at the Chemist’s Coffeehouse and
have a choice of two cups:...
asked 6 hours ago -
Which of the following pairs of chemicals could be used to make
a buffer solution?
A.)...
asked 6 hours ago -
Problem 16-51 Sales
Activity Variance (LO 16-3)Odessa, Inc., reports the following
information concerning operations for the...
asked 7 hours ago -
Pictured on the right are thee point charges Q1 = 18.4 μC, Q2 =
-30.6 μC,...
asked 7 hours ago -
A graduate student is conducting research in psychology and
needs to obtain the IQ scores of...
asked 7 hours ago -
R2.84: There are 2 defective products in a production lot of 10.
An inspector randomly selected...
asked 9 hours ago -
Consider the following equilibrium system: COCl2(g) CO(g) +
Cl2(g) A 10.00 L evacuated flask is filled...
asked 9 hours ago -
1) What are the two distinct steps that one needs to perform
when developing a data...
asked 9 hours ago