1.What are the differences between automata and Markov models? How are they simi
ID: 3649393 • Letter: 1
Question
1.What are the differences between automata and Markov models? How are they similar?2.Are Turing machines still useful in their original form? What are some domains in which they can be used?
3. Think of a process you are often exposed to that would be simple to translate into an algorithm. Briefly describe the process and explain why translating it into an algorithm would be simple. What makes it so easy? What are some aspects of processes in general that make their translation into algorithms so simple?
4.Think of a process you are often exposed to that would be difficult to translate into an algorithm. Briefly describe the process and explain why translating it into an algorithm would be difficult. What makes it so difficult? What are some aspects of processes in general that make their translation into algorithms so difficult?
5.Are there potential substitutes to asymptotic notation? Or is this the only way to quantify the complexity of an algorithm? What are some potential drawbacks of this approach?
6. What are some ways in which you would incorporate the use of asymptotic notation in the analysis of the solution to a problem during the design phase? What are some ways in which you would maintain a high quality of the final product by rigorously checking its complexity? Suggest methods that seem feasible
7.What are some processes of the human mind that you believe would be too complex for a computer system to replicate? Illustrate such processes as they are carried out by humans and then provide reasons why they would be too complex for a computer.
8. How would you handle a situation in which a senior colleague has implemented an algorithm and is unable to replicate the complexity of the problem? What actions would you take in such a situation?
Explanation / Answer
Turing machines have never existed in the real world, and never were intended to be. So no, they were never "useful." They only exist as a thought experiment to demonstrate principles of algorithms. In recent years, they have been simulated using modern computers and programming languages, but to my knowledge no one has ever built a "Turing Machine". And think about it -- the whole concept of a Turing Machine is to have an Infinite Tape -- so right there, the concept of having Infinite Storage should clue you in to how the whole concept is pure fantasy. For instructional purposes only -- do not attempt to build.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.