Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 12, Problem 14CRP
Program Plan Intro
Turing machine:
Turing machine is used as a tool to understand the power of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
The state transition diagram for a Turing machine that performs unary increment is shown below.
FIGURE 12.6
1/1/R
State 1
6/1/R
State 2
State diagram for the incrementer
Show how this Turing machine will process the input "1111111". You are required to show the configuration of the Turing machine at the
beginning of the execution and after each execution step until the Turing machine halts.
a) Explain on Simulated Annealing algorithm behaves at very high temperatures,
and how it behaves at very low temperatures.
(b) Imagine the implementation of Simulated Annealing algorithm in real life. Let's
say, you have a caretaker at your home. Your home has a garden and it has a
fountain with a network of pipes that contains 150 faucets. You informed your
caretaker that you are going for short holiday to Langkawi for 3 days and when
you return you would like the fountain to spray as high as possible. Your
caretaker knows that it is impossible to check all faucets within 3 days to obtain
an optimal setting. You can use Simulated Annealing algorithm to maximize the
height of the fountain, also can assume whether a faucet can be ON or OFF and
measuring the water height. Adding to that, you can make any other
assumptions required for this scenario, explain clearly using Simulated Annealing
algorithm.
In "Computing Machines and Intelligence," the English mathematician Alan Turing (1912-1954) wrote,
"If each man had a definite set of rules of conduct by which he regulated his life, he would be a machine, but there are no such rules, so men cannot be machines."
Using what you now know about Logic, determine whether this statement make sense and explain. Construct a truth table for Turing's statement and determine if this statement is a tautology.
Chapter 12 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Ch. 12.1 - Prob. 1QECh. 12.1 - Prob. 2QECh. 12.1 - Prob. 3QECh. 12.1 - Prob. 4QECh. 12.2 - Prob. 1QECh. 12.2 - Prob. 2QECh. 12.2 - Prob. 3QECh. 12.2 - Prob. 4QECh. 12.2 - Prob. 5QECh. 12.3 - Prob. 1QE
Ch. 12.3 - Prob. 3QECh. 12.3 - Prob. 5QECh. 12.3 - Prob. 6QECh. 12.4 - Prob. 1QECh. 12.4 - Prob. 2QECh. 12.4 - Prob. 3QECh. 12.5 - Prob. 1QECh. 12.5 - Prob. 2QECh. 12.5 - Prob. 4QECh. 12.5 - Prob. 5QECh. 12.6 - Prob. 1QECh. 12.6 - Prob. 2QECh. 12.6 - Prob. 3QECh. 12.6 - Prob. 4QECh. 12 - Prob. 1CRPCh. 12 - Prob. 2CRPCh. 12 - Prob. 3CRPCh. 12 - In each of the following cases, write a program...Ch. 12 - Prob. 5CRPCh. 12 - Describe the function computed by the following...Ch. 12 - Describe the function computed by the following...Ch. 12 - Write a Bare Bones program that computes the...Ch. 12 - Prob. 9CRPCh. 12 - In this chapter we saw how the statement copy...Ch. 12 - Prob. 11CRPCh. 12 - Prob. 12CRPCh. 12 - Prob. 13CRPCh. 12 - Prob. 14CRPCh. 12 - Prob. 15CRPCh. 12 - Prob. 16CRPCh. 12 - Prob. 17CRPCh. 12 - Prob. 18CRPCh. 12 - Prob. 19CRPCh. 12 - Analyze the validity of the following pair of...Ch. 12 - Analyze the validity of the statement The cook on...Ch. 12 - Suppose you were in a country where each person...Ch. 12 - Prob. 23CRPCh. 12 - Prob. 24CRPCh. 12 - Suppose you needed to find out if anyone in a...Ch. 12 - Prob. 26CRPCh. 12 - Prob. 27CRPCh. 12 - Prob. 28CRPCh. 12 - Prob. 29CRPCh. 12 - Prob. 30CRPCh. 12 - Prob. 31CRPCh. 12 - Suppose a lottery is based on correctly picking...Ch. 12 - Is the following algorithm deterministic? Explain...Ch. 12 - Prob. 34CRPCh. 12 - Prob. 35CRPCh. 12 - Does the following algorithm have a polynomial or...Ch. 12 - Prob. 37CRPCh. 12 - Summarize the distinction between stating that a...Ch. 12 - Prob. 39CRPCh. 12 - Prob. 40CRPCh. 12 - Prob. 41CRPCh. 12 - Prob. 42CRPCh. 12 - Prob. 43CRPCh. 12 - Prob. 44CRPCh. 12 - Prob. 46CRPCh. 12 - Prob. 48CRPCh. 12 - Prob. 49CRPCh. 12 - Prob. 50CRPCh. 12 - Prob. 51CRPCh. 12 - Prob. 52CRPCh. 12 - Prob. 1SICh. 12 - Prob. 2SICh. 12 - Prob. 3SICh. 12 - Prob. 4SICh. 12 - Prob. 5SICh. 12 - Prob. 6SICh. 12 - Prob. 7SICh. 12 - Prob. 8SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Build a turing machine with three tracks that add two binary numbers. Considerate the data is stored in the first two tracks and aligned to the right. The result would be written to the third track which is initially empty. Make the ilustration of the turing machine and please explain all steps of the solution.arrow_forwardBuild a Turing Machine T.M with three tracks that add two binary numbers. We will consider that the datas are stored in the first two tracks and are aligned to the right. The result will be written to the third track which is initially empty.arrow_forwardGiven a transition graph of a Turing machine. (a) Write a program for the Turing Machine Simulator based on the given transition graph. (b) Test (at least one time) your program (a) on the Turing Machine Simulator. Give the screen images: - before the work of TMS - after the work of TMS (c) What the given Turing machine computes? (d) In how many steps the given Turing machine processes the input data of the length n?arrow_forward
- Build a Turing Machine T.M. with three tracks that receives two binary numbers and indicates which of the two is higher. We will consider that the data are stored in the first two tracks and aligned to the right, it means, the least significant bits of both are located in the same column. In the third track it will be written a B, a L or an E, indicating respectively that the first number is larger, smaller or equal to the second.arrow_forwardProblem 8: Design a Turing machine that takes inputs like...B1110111111B..... deletes the middle 0, and keeps the same number of 1s (so, in this case, it should output ...B111111111B...). This can be thought of as adding two numbers.arrow_forward4. Draw the Turing machine that computes the function f(x,y) = x+2y, with both x and y strictly positive integers.arrow_forward
- Give the transition diagram for a Turing machine to compute the function f(x) = x + 3, where x is an integer expressed in unary notation. If you would like to assume that there is a special symbol such as $ on the left hand side of the tape, that is fine. Keep in mind that the Turing machine should end with the read/write head on the first symbol of the output, and there should be nothing on the tape except the output (and the $ symbol if you use it).arrow_forwardDesign a Multitape Turing Machine for Binary to Unary conversion. Proper explanation with an example. Only correct answers, if you are unsure of answer please dont answer it.arrow_forwardGiven the Turing Machine M as follows. (image) Complete the following: (A) Complete the computation of the string aabbc on the Turing Machine above. The computation of the input string aabbc is q0BaabbcB ├ Bq1aabbcB ├ Baq2abbcB ├ (............) ├ BaXbq3bcB ├ BaXbbq3cB ├ (............) ├ BaXq4bbYB ├ Baq4XbbYB ├ (............) ├ (............) ├ BaXbbq5YB ├ BaXbbYq5B ├ (............) RESULT: The string aabbc is Answer because the computation halt at Answer which is a (............) state. (B) What is the language of L(M)? L = {(............)}Note: ^ is to represent superscript feature. (C) What is the shortest string that is IN the language L(M). (............)arrow_forward
- Could you assist me with this question? I'm finding it challenging and would appreciate a step-by-step explanation.question that I really need help with:5.13 A useless state in a Turing machine is one that is never entered on any input string. Consider the problem of determining whether a Turing machine has any useless states. Formulate this problem as a language and show that it is undecidable.arrow_forwardDesign a Turing machine that computes the function S1 if w is even lo if w is odd Note that you need to use unary representation for w. For example, if w = 3, then representation f(w) = of w is 111.arrow_forwardA board game has the following layout (see image) a) draw a finite state machine diagram representing the playing of this game for one player. For input, use '1' for heads and '0' for tails. There is no output. b) Construct the corresponding truth table.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education