Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

It is Cmputability problem, I have difficulty figuring ut the answers. Please can somebody help? Well proved and explained answer would be helpful. Thank yu!

It is Cmputability problem,

I have difficulty figuring ut the answers.

Please can somebody help?

Well proved and explained answer would be helpful. image text in transcribed Thank yu!

3. (10 points) In this problem, we will prove that ALLTM = {(A) 1 M is a Turing machine over and L(M) = *) is not recognizable and not co-recognizable a. Provide a reduction function F from ATM to ALLTM. b. Prove that the function G is a reduction from ATM to ALLTM G: "On input r: If r is not of the form (M, w) for a Turing machine M and a string w then output constout such that constout E ALLTM Otherwisea(M, w) Build machine M': "On input z: Let z be the ith string in standard string order Run M on w for onlyi steps. If M accepts w within i steps then M' rejects z If M rejects w within i steps then M' accepts z Otherwise, if the computation has not ended, then accept z." Output (M'." c. Justify why parts a. and b. imply that ALLTM is not Turing-recognizable and not Turing-co-recognizable. 3. (10 points) In this problem, we will prove that ALLTM = {(A) 1 M is a Turing machine over and L(M) = *) is not recognizable and not co-recognizable a. Provide a reduction function F from ATM to ALLTM. b. Prove that the function G is a reduction from ATM to ALLTM G: "On input r: If r is not of the form (M, w) for a Turing machine M and a string w then output constout such that constout E ALLTM Otherwisea(M, w) Build machine M': "On input z: Let z be the ith string in standard string order Run M on w for onlyi steps. If M accepts w within i steps then M' rejects z If M rejects w within i steps then M' accepts z Otherwise, if the computation has not ended, then accept z." Output (M'." c. Justify why parts a. and b. imply that ALLTM is not Turing-recognizable and not Turing-co-recognizable

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

SQL Antipatterns Avoiding The Pitfalls Of Database Programming

Authors: Bill Karwin

1st Edition

1680508989, 978-1680508987

More Books

Students also viewed these Databases questions