Consider this Turing Machine M1: 1/1,R /R qr /R 90 94 1/1,R 0/L,R 0/1, R 1/1, R 0/1, R 0/0,R 91 92 1/1,R /,R -/-R ~/~₁L qa 93 0/0,L 1/1,L M computes a partial function F(M) : Σ* → I*. * F(M)(w) = xy if (ɛ, qo, w) →* (x, q, y) where q = {qa, qr} and xy has no at either end. * Otherwise, F(M) is undefined at w. *xy is the contents of the tape when M halts. * ƒ : Σ* → I'* is partially computable if f = F(M) for some TM M. * f : Σ* → I* is computable if f = F(M) for some total TM M. Question: Consider the partial function F(M₁) computed by M₁. What is F(M₁)(0000)? That is, what does M₁ compute for input 0000?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Consider this Turing Machine M1:
1/1,R
/R
qr
/R
90
94
1/1,R
0/L,R
0/1,R
1/1,R
0/1,R
0/0,R
91
92
1/1,R
/,R
/R
/L
qa
93
0/0,L
1/1,L
M computes a partial function F(M) : Σ* → I*.
* F(M)(w) = xy if (ɛ, qo, w) →* (x, q, y) where q = {qa, qr} and xy has no at either end.
* Otherwise, F(M) is undefined at w.
*xy is the contents of the tape when M halts.
*f: E* → I* is partially computable if f = F(M) for some TM M.
* f : Σ* → I* is computable if f = F(M) for some total TM M.
Question:
U
Consider the partial function F(M₁) computed by M₁. What is F(M₁) (0000)? That is, what
does M₁ compute for input 0000?
Transcribed Image Text:Consider this Turing Machine M1: 1/1,R /R qr /R 90 94 1/1,R 0/L,R 0/1,R 1/1,R 0/1,R 0/0,R 91 92 1/1,R /,R /R /L qa 93 0/0,L 1/1,L M computes a partial function F(M) : Σ* → I*. * F(M)(w) = xy if (ɛ, qo, w) →* (x, q, y) where q = {qa, qr} and xy has no at either end. * Otherwise, F(M) is undefined at w. *xy is the contents of the tape when M halts. *f: E* → I* is partially computable if f = F(M) for some TM M. * f : Σ* → I* is computable if f = F(M) for some total TM M. Question: U Consider the partial function F(M₁) computed by M₁. What is F(M₁) (0000)? That is, what does M₁ compute for input 0000?
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY