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

can you plz help with some project ideas relatede to DFA or NFA or anything

A common approach in solving problems is to transform them to different problems, solve the new ones, and derive the solutions for the original problems from those for the new ones

Different types of applications and numerous programming languages have been developed to make easy the task of writing programs. The assortment of programming languages shows, dif

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}

The generalization of the interpretation of strictly local automata as generators is similar, in some respects, to the generalization of Myhill graphs. Again, the set of possible s

Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

I want a proof for any NP complete problem