Purchase Solution

Logic : Turing Machines

Not what you're looking for?

Ask Custom Question

Please see the attached file for the fully formatted problems.

(a) We wish to design a Turing machine which, using monadic notation, inputs a
pair (in, n) of positive integers in standard starting position (on an otherwise blank tape), and which halts scanning the rightmost of a string of in is on an otherwise blank tape.
Write down which of the following Turing nuchines is suitable for this task. For each machine which is unsuitable, explain why it is unsuitable this explanation can take the form of a sequence of configurations for appropriate test data.
.....
(b) Devise and give the flow graph of a Turing machine which, if started scanning the rightmost of a string of n is (on an otherwise blank tape). would halt scanning a single 1 on an otherwise blank tape.
.....
In this question, we consider the Turing machine 31 with the flow graph below.
...
(a) Write down the machine table for 31. [2]
(b) For each of the following starting configurations of the machine 31. write down the sequence of configurations for the subsequent computation.
(i)0110 (ii) 01110 (iii)0111110
...
(c) The machine 31 has been designed to take as input a positive integer in monadic notation and to output an integer also in monadic notation. Thu.s the machine computes the values of a function!': P ?> N.
(i) Wnte down the values of f(l),f(2),f(3),f(4),f(5). [2.5]
(ii) What, in general. is the value off(n) for vs Є p Describe briefly how the machine computesJ(n), including an indication of each possible halting state and the circumstances under which it halts there.
.....

Attachments
Purchase this Solution
Solution Summary

Turing machines are investigated. The solution is detailed and well presented.

Purchase this Solution
Free BrainMass Quizzes
Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

C# variables and classes

This quiz contains questions about C# classes and variables.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

View More Free Quizzes
Related BrainMass Solutions

  • Turing machines for Bitwise and Boolean NOT operations

    155781 Turing machines for Bitwise and Boolean NOT operations Give Turing machines for bitwise and boolean NOT operations under following restrictions. - only single tape deterministic turing machines can be used.

  • Turing Machines and PDP Networks

    Turing machines apply rules for the specific manipulation of discrete symbols.

  • Turing-recognizable language

    121808 Turing-recognizable language Let A be a turing-recognizable language consisting of descriptions of Turing machines, {M1, M2,...}, where every Mi is a decider.

  • Universal Turing Machine

    In contrast, the programming description can be easily changed simply by altering the machines description on the tape. See http://plato.stanford.edu/entries/turing-machine/. I hope this helps and take care.

  • The question of artificial intellgence

    287122 Turing Test Psychologist Stevan Harnad has proposed the Total Turing Test for artificial intelligence.

  • Validity of Turing Test

    541148 Validity of Turing Test 1. Argue that the Turing Test is a strong and valid test for human-like intelligence in machines. Propose a single modification that would provide the greatest improvement to the test. 2.

  • Automata and Computability: Example Problem

    113573 Automata and Computability: Example Problem Recall that NPSAT is the class of languages that are recognized by nondeterministic polynomial time Turing machines with an oracle for the satisfiability problem. Show that NPSAT = 2P.

  • The Turing Test

    Essentially their research was an application of the Turing principle - that certain machines can learn how to answer in a 'human manner' so that if a person cannot tell which response are that from a computer and which ones are from a human being, the

  • Influence of mathematics on electronics

    He was a child prodigy born into a family in Budapest, Hungary. (5) - He was a brilliant mathematician known for his contribution to the fields of mathematical logic(5) - He also contributed to quantum mechanics.

View More Related Solutions