Question

Anyone please tell me "What is Turing Machine?". And if possible give me some examples.

Answer 1

http://en.wikipedia.org/wiki/Turing_machine
http://en.wikipedia.org/wiki/Turing_machine_examples
http://www.google.com/search?q=turing+machine&hl=en&newwindow=1&prmd=imvnsb&tbm=isch&tbo=u&source=univ&sa=X&ei=z3dtUOf-GM_yiQL1hYHQCw&ved=0CEEQsAQ&biw=1120&bih=642
http://mathworld.wolfram.com/TuringMachine.html

Answer 2

actually I have seen the theory but somewhere I read that behind every computation there is Turing Machine. So I am unable to imagine what it is exactly?

Answer 3

did you look at the images?

Answer 4

Yeah.. It's like Tape or Something like Train.

Answer 5

Try this link and you guys will have all you need to know about turing machine: http://en.wikipedia.org/wiki/Turing_machine.

Answer 6

@jemedis your link does not work for me:(

Answer 7

Take out the period at the end of jemedis's url and you'll have it.

Essentially, computers were based off of the turing machine, so all of the logic that follows with how a state transfers to another state is related to his machine. It's a very complex subject, so it may be difficult finding it explained in layman's terms.

Answer 8

You can see an explanation at Roger Penrose's book The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics

Answer 9

Yes, modern comnputers are an evolution of sorts from Turing Machines. As for the statement "behind every computation there is Turing Machine". Taken literally this is not true but all modern computers are what's known as "Turing Complete". Turing complete basically means that the machine has a sufficient set of basic instructions such that it can compute anything computable. This is really all one usually needs to know unless you are getting deep into the history and operation of Turing Machines for some reason.

Answer 10

scheme is turing complete

Answer 11

@msmithhnova : Means I can say that modern computer performs it's task by executing set of instructions(Turing Complete) is what we can say Turing machine instead of executing it bit by bit like old computers.(like tape system)

Answer 12

That sounds reasonable to me. One thing of note is that at it's very basics computers are still a series of highly efficient switches with on/off or 0/1 positions. Assembly language is about the most basic that any gets when doing anything on a computer aside from hardware. This can be like (mov ax,10101) (mov bx,10101) (add ax,bx), which basically says put value 10101 binary in both the ax and bx registers and then add bx to ax.

Answer 13

Ok... Thank You.. :)