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
Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

Find the Regular Grammar for the following Regular Expression:                    a(a+b)*(ab*+ba*)b.

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea

s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbol?

s-> AACD A-> aAb/e C->aC/a D-> aDa/bDb/e

how many pendulum swings will it take to walk across the classroom?

We developed the idea of FSA by generalizing LTk transition graphs. Not surprisingly, then, every LTk transition graph is also the transition graph of a FSA (in fact a DFA)-the one

While the SL 2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless

Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima