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

Xx, Ask queyystion #Minimum 100 words accepted# Ask queyystion #Minimum 100 words accepted#

Theory of computation, Computations are deliberate for processing informati... Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

Recognition problem, The Recognition Problem for a class of languages is th... The Recognition Problem for a class of languages is the question of whether a given string is a member of a given language. An instance consists of a string and a (?nite) speci?cat

Finite-state automaton, Paths leading to regions B, C and E are paths which... Paths leading to regions B, C and E are paths which have not yet seen aa. Those leading to region B and E end in a, with those leading to E having seen ba and those leading to B no

Instantaneous description - recognizable language, De?nition (Instantaneous... De?nition (Instantaneous Description) (for both DFAs and NFAs) An instantaneous description of A = (Q,Σ, δ, q 0 , F) , either a DFA or an NFA, is a pair h q ,w i ∈ Q×Σ*, where

Formal languages and grammar, The universe of strings is a very useful medi... The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

Union, Intuitively, closure of SL 2 under intersection is reasonably easy ... 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

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?

Wearable computers.., what are the advantages and disadvantages of wearable... what are the advantages and disadvantages of wearable computers?

Ogdens lemma, proof ogdens lemma .with example i am not able to undestand ... proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .