/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q22P Use the result of Problem 6.21 t... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 0: Q22P (page 1)

Use the result of Problem 6.21 to give a function f that is computable with an oracle for ATM, where for each n,f(n) is an incompressible string of length n.

Short Answer

Expert verified

The given statement is proved.

Step by step solution

01

Turing Recognizable

A language L is said to be Turing Recognizable if and only if there exist any Turing Machine (TM) which recognize it i.e., Turing Machine halt and accept strings belong to language L and will reject or not halt on the input strings that doesn鈥檛 belong to language L.

02

Proof of the statement.

We have already computed descriptive complexity of string K(x) with an oracle for ATM.

We have to know about the definition of incompressible string of length n.

Let as assume (x)be any string.

So, if (x)don鈥檛 have description smaller than itself, which means (x) is incompressible.

Let f be a function which is computable by oracle for ATM.

Now we will calculate f(n) for each value of n. For this we will construct oracle Turing Machine M which work as:

  • Enumerate all strings (x) of length
  • Calculate K(x) for each x by using ATM
  • If we get (x) =f(n) and K(x) 鈮� Length (x)

Output: (x)

Halt

Here, K(x) 鈮� Length(x) signifies that we got a string which is greater than its description.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

A two-dimensional finite automaton (2DIM-DFA) is defined as follows. The input is an m脳nrectangle, for any m,n鈮�2. The squares along the boundary of the rectangle contain the symbol # and the internal squares contain symbols over the input alphabet 鈭�. The transition function 未:Q脳鈭�鈭�#鈫�Q脳L,R,U,Dindicates the next state and the new head position (Left, Right, Up, Down). The machine accepts when it enters one of the designated accept states. It rejects if it tries to move off the input rectangle or if it never halts. Two such machines are equivalent if they accept the same rectangles. Consider the problem of determining whether two of these machines are equivalent. Formulate this problem as a language and show that it is undecidable.

Use the results of Exercise 2.16to give another proof that every regular language is context- free, by showing how to convert a regular expression directly to an equivalent context-free grammar.

Recall, in our discussion of the Church鈥揟uring thesis, that we introduced the language is a polynomial in several variables having an integral root}. We stated, but didn鈥檛 prove, thatis undecidable. In this problem, you are to prove a different property of鈥攏amely, thatDis -hard. A problem is -hard if all problems in are polynomial time reducible to it, even though it may not be inNPitself. So you must show that all problems in NPare polynomial time reducible to D .

Read the informal definition of the finite state transducer given in Exercise 1.24. Give the state diagram of an FST with the following behaviour. Its input and output alphabets are 0,1 . Its output string is identical to the input string on the even positions but inverted on the odd positions. For example, on input 0000111 it should output 1010010 .

Consider the problem of determining whether a Turing machine Mon an input w ever attempts to move its head left at any point during its computation on w. Formulate this problem as a language and show that it is decidable.
See all solutions

Recommended explanations on Computer Science Textbooks

Computer Programming

Read Explanation

Game Design in Computer Science

Read Explanation

Fintech

Read Explanation

Computer Network

Read Explanation

Cloud Services

Read Explanation

Blockchain Technology

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.