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

Prepare the consolidated financial statements, Prepare the consolidated fin... Prepare the consolidated financial statements for the year ended 30 June 2011. On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , J

How to solve the checking problem, The objective of the remainder of this a... The objective of the remainder of this assignment is to get you thinking about the problem of recognizing strings given various restrictions to your model of computation. We will w

Computations of sl automata, We will specify a computation of one of these ... We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

Research poster, RESEARCH POSTER FOR MEALY MACHINE RESEARCH POSTER FOR MEALY MACHINE

Automata, automata of atm machine automata of atm machine

Path function of a nfa, The path function δ : Q × Σ*→ P(Q) is the extension... The path function δ : Q × Σ*→ P(Q) is the extension of δ to strings: Again, this just says that to ?nd the set of states reachable by a path labeled w from a state q in an

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

Research poster, RESEARCH POSTER FOR MEALY MACHINE RESEARCH POSTER FOR MEALY MACHINE

Pumping lemma constant, a) Let n be the pumping lemma constant. Then if L i... a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le

Abstract model of computation, When we say "solved algorithmically" we are ... When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program