/*! 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} Q7E Explain why the following is not... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 3: Q7E (page 188)

Explain why the following is not a description of a legitimate Turing machine. Mbad= 鈥淥n input (p), a polynomial over variablesx1,...,xk:

1. Try all possible settings of x1,...,xk:to integer values.

2. Evaluate p on all of these settings.

3. If any of these settings evaluates to 0, accept; otherwise, reject.鈥�

Short Answer

Expert verified

The machine requires all possible numbers as input. This is not a legitimate Turing machine because they have not been provided.

Step by step solution

01

Explain Turing machine

A Turing machine is a computer programme that, in theory, uses a table of rules to manipulate symbols on a tape strip. The Turing machine is a simple machine, it is made to mimic the logic of any computer algorithm. It is also very helpful for explaining how a computer's CPU works.

02

Define Legitimate Turing machine

Turing machines decides and recognize the decidable/recognizable languages. Turing machines compute the changes in the current state and the content of the current tape. The Turing machine computes the current head location also. The computation of the language continues until the state becomes an acceptorrejectstate.

The description does not provide an upper bound for integer values the Turing Machine must check, so it is possible that it is never stop checking values. Therefore, there is no point whereMbad rejects.

To complete the calculation, the aforementioned machine requires all possible numbers as input. This is not a legitimate Turing machine because they have not been provided.

Hence, the given Turing Machine does not have a legitimate 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

Let A be the language containing only the single string s, where

s=(0iflifeneverwillbefoundonMars.鈥娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌娾赌�1iflifewillbefoundonMarssomeday.)

Is decidable? Why or why not? For the purposes of this problem, assume that the question of whether life will be found on Mars has an unambiguous YES or NO answer.

Let c1xn+c2xn-1+路路路+cnx+cn+1be a polynomial with a root atx=x0 . Let role="math" localid="1659797796589" cmaxbe the largest absolute value of a . Show that

|x0|<(n+1)cmaxc1

Give implementation-level descriptions of Turing machines that decide the following languages over the alphabet

a. {w|wcontainsanequalnumberof0sand1s}

b.{w|wcontainstwiceasmany0sas1s}

c.{w|wdoesnotcontaintwiceasmany0sas1s}

Question:LetB={M1),(M2.......} be a Turing-recognizable language consisting of TM descriptions. Show that there is a decidable language C consisting of TM descriptions such that every machine described in B has an equivalent machine in C and vice versa.

A Turing machine with doubly infinite tape is similar to an ordinary Turing machine, but its tape is infinite to the left as well as to the right. The tape is initially filled with blanks except for the portion that contains the input. Computation is defined as usual except that the head never encounters an end to the tape as it moves leftward. Show that this type of Turing machine recognizes the class of Turing-recognizable languages.
See all solutions

Recommended explanations on Computer Science Textbooks

Data Representation in Computer Science

Read Explanation

Fintech

Read Explanation

Computer Network

Read Explanation

Computer Systems

Read Explanation

Theory of Computation

Read Explanation

Computer Programming

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.