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

Ask an Expert

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

Write your message here..

Related Questions

Multiple instruction single data stream, short application for MISD short application for MISD

Closure properties of recognizable languages, We got the class LT by taking... We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

Push down automata, Construct a PDA that accepts { x#y | x, y in {a, b}* su... Construct a PDA that accepts { x#y | x, y in {a, b}* such that x ? y and xi = yi for some i, 1 = i = min(|x|, |y|) }. For your PDA to work correctly it will need to be non-determin

Transition graph for the automaton, Lemma 1 A string w ∈ Σ* is accepted by ... Lemma 1 A string w ∈ Σ* is accepted by an LTk automaton iff w is the concatenation of the symbols labeling the edges of a path through the LTk transition graph of A from h?, ∅i to

Myhill-nerode theorem, This close relationship between the SL2 languages an... 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.

Strictly local languages, We have now de?ned classes of k-local languages f... We have now de?ned classes of k-local languages for all k ≥ 2. Together, these classes form the Strictly Local Languages in general. De?nition (Strictly Local Languages) A langu

Programming languages, Different types of applications and numerous program... 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

Myhill graph of the automaton, Exercise:  Give a construction that converts... Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

Turing machine, explain turing machine . explain turing machine .

Can you help me in automata questions, i have some questions in automata, c... i have some questions in automata, can you please help me in solving in these questions?