Question

Compare your physical computer (or any given physical computer really), to a Turing machine. Are they...

  1. Compare your physical computer (or any given physical computer really), to a Turing machine. Are they logically identical? If not, what is the main difference?

Homework Answers

Answer #1

A Turing machine is an abstract, notional machine which can compute more than any physical computer. This is because your physical computer has access to only a bounded amount of memory & your computer's processing speed is limited by various real world constraints. Another comparision is that, a turing machine typically don't need an I/O device i.e, the input is provided on input tape, and when the machine is turned on, the output is recorded on the tape, and the machine halts. But your physical computers always needs an I/O device to interact with the user.

Yes, they are logically identical. A turing machine input tape is closely equivalent to the combining efforts of computer's memory plus I/O devices(as it can provide some extent of  unlimited "tapes", but not an infinite amount of it).So we can say that a physical computer can simulate a turing machine.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Write a Turing-machine style of algorithm to decide the language L1 given below. Use specific, precise,...
Write a Turing-machine style of algorithm to decide the language L1 given below. Use specific, precise, step-by-step English. So, describe how to test whether or not an input string is in the language L1 in finite time. No need to write a state diagram. L1 = {w : every ‘a’ within w is to the left of every ‘b’ within w} over the following alphabet Σ = {a, b, c}. In other words, you’re not allowed to have any ‘b’...
Write a Turing-machine style of algorithm to decide the language L2 given below. Use specific, precise,...
Write a Turing-machine style of algorithm to decide the language L2 given below. Use specific, precise, step-by-step English. So, describe how to test whether or not an input string is in the language L2 in finite time. No need to write a state diagram. L2 = {w : w has more a’s than it has b’s and c’s combined} over the alphabet Σ = {a, b, c}. Example strings: abaca ∈ L2. bcaa ∉ L2.
on your own words! what physical difference would stem cells (any) have when compared to the...
on your own words! what physical difference would stem cells (any) have when compared to the differentiated cells? where is the load lever and fulcrum in lifting one straight leg to the anterior with the knee locked fully extended?
Computer archieture 1. Let us assume we have such a machine. The physical RAM has 32...
Computer archieture 1. Let us assume we have such a machine. The physical RAM has 32 bytes, and is evenly divided into 4 pages. The virtual memory has 16 pages. The content in the page table and physical RAM is shown below Physical RAM Page Num Page data 3 11 ~QWERTYU 2 10 IOPASDFG 1 01 HJKLZXCV 0 00 BNM<>[]? Page table 15 0 14 0 13 0 12 1 01 11 0 10 0 9 1 11 8 0...
The computer that controls a bank's automatic teller machine crashes a mean of 0.5 times per...
The computer that controls a bank's automatic teller machine crashes a mean of 0.5 times per day. What is the probability that, in any seven-day week, the computer will crash more than 5 times? Round your answer to four decimal places.
At any given time, how would the yield curve facing a AAA rated company compare with...
At any given time, how would the yield curve facing a AAA rated company compare with the yield curve for U.S. treasury securities? At any given time, how would the yield curve facing a BB rated company compare with the yield curve for U.S. treasury securities? Draw a graph to illustrate your answer  
The computer that controls a bank's automatic teller machine crashes a mean of  0.5 times per day....
The computer that controls a bank's automatic teller machine crashes a mean of  0.5 times per day. What is the probability that, in any seven-day week, the computer will crash more than 4 times? Round your answer to four decimal places.
Qualitatively, how would the magnitude of the molar extinction coefficient compare in the infrared and the...
Qualitatively, how would the magnitude of the molar extinction coefficient compare in the infrared and the visible region? What is the physical factors determine any difference?
Add a recursive Boolean function called bool isGreater(int compare) to class IntegerLinkedList to check if any...
Add a recursive Boolean function called bool isGreater(int compare) to class IntegerLinkedList to check if any of the linked list data values is greater than the given parameter, compare. For example, isGreater(25) should return true and isGreater(100) should return false for the the linked list shown below. A main function (prob3.cpp) is given to you to add data values to the linked list and test your function. Other examples are given in the main function. // ADD ANSWER TO THIS...
the computer that controls a banks automatic teller machine crashes a mean of 0.4 times per...
the computer that controls a banks automatic teller machine crashes a mean of 0.4 times per day. what is the probability that in any seven day week the computer will crash more than 5 times
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT