what is a turing machine, Theory of Computation

A Turing machine is a theoretical computing machine made-up by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine having of a line of cells called as a "tape" that can be moved back and forth, an active element called as the "head" that possesses a property called as "state" and that can change the property called as "color" of the active cell underneath it, and a set of instructions for how the head should modify the active cell and move the tape. At every step, the machine may changes the color of the active cell, modify the state of the head, and then move the tape one unit to the left or right.

 

 

Posted Date: 4/6/2013 3:44:02 AM | Location : United States







Related Discussions:- what is a turing machine, Assignment Help, Ask Question on what is a turing machine, Get Answer, Expert's Help, what is a turing machine Discussions

Write discussion on what is a turing machine
Your posts are moderated
Related Questions
Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.

i want to do projects for theory of computation subject what topics should be best.

https://www.google.com/search?q=The+fomula+n%3D%28x%3D0%29%2F%281%3D2%29.The+value+x%3D0+and+is+used+to+stop+the+algerithin.The+calculation+is+reapeated+using+values+of+x%3D0+is+in

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting

It is not hard to see that ε-transitions do not add to the accepting power of the model. The underlying idea is that whenever an ID (q, σ  v) directly computes another (p, v) via

write short notes on decidable and solvable problem

1. Simulate a TM with infinite tape on both ends using a two-track TM with finite storage 2. Prove the following language is non-Turing recognizable using the diagnolization

We represented SLk automata as Myhill graphs, directed graphs in which the nodes were labeled with (k-1)-factors of alphabet symbols (along with a node labeled ‘?' and one labeled

State and Prove the Arden's theorem for Regular Expression