True or False (and justify). a) For each Turing machine M, there is some Turing machine M₁ with L(M) = L(M₁) and such that M₁ never loops (i.e. its computations must accept or reject). b) For each Turing machine M, there is some Turing machine M₂ with L(M) = L(M₂) and such that M₂ never rejects (i.e. its computations must accept or loop). c) For each Turing machine M, there is some Turing machine M3 with L(M)=L(M3) and such that M3 never accepts (i.e. its computations must reject or loop).

True or False (and justify). a) For each Turing machine M, there is some Turing machine M₁ with L(M) = L(M₁) and such that M₁ never loops (i.e. its computations must accept or reject). b) For each Turing machine M, there is some Turing machine M₂ with L(M) = L(M₂) and such that M₂ never rejects (i.e. its computations must accept or loop). c) For each Turing machine M, there is some Turing machine M3 with L(M)=L(M3) and such that M3 never accepts (i.e. its computations must reject or loop).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Design a Turing machine M such that L(M) = L(01*0)
Construct a Turing Machine with vocabularyi-(0,1). that erases any data given as input. Hence this Turing machine is to be designed such that, when an arbitrary sequence of Os and 1s is given as input to the machine, It replaces all symbols with symbol B (which represents "Blank) and then halts. For example, if there is initially". B110100B ." on the tape, then the final content of the tape must be ". BBBBBBBB . Make sure that your machine works with any sequence of 0s and 1s with arbitrary finite length. Assume that there is initially no blank (B) symbol in between the leftmost and rightmost non-blank positions on the tape. O (so 0. 51. B. R). (5o 1. 5. B. R). (51. 0. S1. B. R). (5. 1, st. BL) O (so 0. 51. B. RV (So, 1s, B. R). (S. B, s1. B, R). (S. 0. so B. L). (s1, 1, so B L) O isp. 0. S. B. R). (so. 1, 51. B. R). (5, 1, So. B. L). (Sp. B, St. 1. R) O 6o 0. so B, R), (so 1. so. L) (5o B 51. 8. L) O 5o 0, 51, B. R). (s1. 0. 5. B. R). (s, 1. 5. B, R) O Go 0, so B. RI (5o 1.5o B. R)
Consider L={(TM) | TM stands for the Turing machine, which halts on all input, and L(TM)= L' for some undecidable language L'}. The encoding of a Turing machine as a string over the alphabet 0-1 is (TM), and L is? decidable and recursively enumerable decidable and recursive decidable and non-recursive undecidable and recursively enumerable
Let T be the Turing Machine defined by the 5-tuples, (So. 0, 0, S₁, L) (So. 1, 0, S. L) (So, B, B, Halt, L) (S₁, 0, 1, S₂. L) (S₁, 1, 1, S₂, R) For each of the following initial tapes, determine the final tapo when Thalts, assuming that T begins in initial position. 1) 110B 2) 0011B 3) 0101B
Let T be the Turing machine defined by the following 5-tuples: (s0, 0, s0, 1, R), (s0, l, s1, 0, R), (s1, l, s2, l, R), (s1, B, s0, 0, R). For the following tape, determine the intermediate tapes, states, and head positions, and final tape, state, and head position when T halts. Assume T begins in the initial position. state s0 ⋯ B B 0 0 0 1 B 0 B B ⋯
Let T be the Turing machine defined by the following 5-tuples: (So, 0, S1, 0, L) (S₁, 1, S₁, 1, R) (S2, 0, S3, 1, R) (So, 1, S₁, 0, L) (S0, B, S₁, 1, R) (S3, 1, S3, 1, R) For the following tape, determine the intermediate tapes, states, and head positions; and final tape, state, and head position when T halts. Assume T begins in the initial position. state (S1, 0, S2, 1, R) (S1, B, S2, 0, R) (S3, 0, S4, 0, R) SO | B | B|1|0|0|B|B|B|
Define the notion of a Turing machine with a two-dimensional tape. Show that a 2-tape ordinary Turing machine can simulate it. Estimate the efficiency of the above simulation. give the running time of the new machine with the running time function TM (n) of the original machine.
Imagine a Turing machine M' that works like a normal Turing machine except that whenever it moves to the left, it moves by two squares instead of one. Its movements to the right are by one square as usual. Show that M' can compute all functions that normal Turing machines can compute.
For a Turing machine M, (M) refers to the binary representation of M. For a Turing machine M, L(M) contains the set of all strings accepted by M. For a Turing machine M and an input x € {0,1}*, Steps(M, x) refers to the number of steps taken by M to execute on x before it halts. Here, one step of execution of M on x = one movement (left or right) of the tape head. For a Turing machine M and an input x = {0,1}*, we define the following: ReachCells(M,x) = {i : M reaches ith tape cell when M is executed on x} Informally, it contains all locations on the tape that are visited when M is ecuted on x. The leftmost location on the tape is the first tape cell, the location next to it is the second tape cell, and so on. A string w₁ is an anagram of w2 if w₁ can be obtained by rearranging the alphabets of w2. Formally, if w₁ is an n length string, wê is called an anagram of w₁ if there exists a permutation à on n elements such that π(w₁) = W2.
Construct a deterministic two-tape Turing machine, which begins with a string of the form an on the first tape, and a string of the form am on the second tape. (n, m ∈ N.) Both heads begin scanning the left-most character of each string. The Turing machine should accept if the number n is an integer multiple of the number m; i.e. there is some integer k such that n = k · m. First, describe the algorithm that your machine uses. Then draw a transition diagram for the machine. To answer properly, your machine should handle the cases when either n or m is zero correctly.
1. Let M be the Turing machine defined by Q = {90, 91, 92, 93, 94, 95, 96, 97} T = {a, b, c, X, Y, Z} 8: 8 B a b C 9⁰ 91,B,R 91 92,a,R 92 93,X,R 97,b,R 93 93,a, R 94,b,R 94 94,b,R 95,Y,R 95 96,Y, L 96 96, a, L 96,b,L 92,X,R 97 98,B,L 97,b,R 98 a) Give the state diagram of M. b) Trace the computation for the input strings aabcc and abbc. c) Give a set-theoretic definition for the language accepted by M. d) Give TWO (2) other strings (beside in (b))) that will be accepted by M. Σ = {a, b, c} ◊=B X qo= qo F = {98} Y 94,Y,R 96,Y, L 97,Y,R N
4. Draw the Turing machine that computes the function f(x,y) = x+2y, with both x and y strictly positive integers.