Can a Turing Machine Execute Multiple Programs?

AI Thread Summary
A Turing machine can execute a specific program defined by its transition table (delta), which is akin to a program in conventional computers. The discussion clarifies that a standard Turing machine is typically hardwired to execute one program, while a universal Turing machine can be reprogrammed to execute multiple programs. This distinction is crucial, as it means that not all Turing machines can simulate others; only a universal Turing machine possesses that capability. The conversation emphasizes the importance of the transition table in defining the machine's functionality and the limitations of a standard Turing machine compared to its universal counterpart.
samaaa
Messages
48
Reaction score
0
Hi:
I read many articles about turing machine,but i still confused:confused:

is a turing machine can only execute one program(hardwired) ?
or it can execute many programs(like a conventional computer)?

i asking about turing machine as shown in figure blew(not asking about universal TM ):
http://s24.postimg.org/52paaxm85/21949732.png
 
Technology news on Phys.org
Delta (item 4) is sometimes called the "table."
That is equivalent to a program you would write for a computer.

I don't remember distinguishing "input symbols" from "tape symbols."
The tape is equivalent to the input and output for a computer.

So you could write any "program" and fill the table, which is you defining delta.
That program could then accept any input on the tape and produce the output on the tape.

Does that help?
 
Bill Simpson said:
Delta (item 4) is sometimes called the "table."
That is equivalent to a program you would write for a computer.

I don't remember distinguishing "input symbols" from "tape symbols."
The tape is equivalent to the input and output for a computer.

So you could write any "program" and fill the table, which is you defining delta.
That program could then accept any input on the tape and produce the output on the tape.

Does that help?
yes that help,
but if the turing machine can execute any "program",
that mean it can simulate any other turing machine ,
so that mean any turing machine we can called it universal turing machine!
 
samaaa said:
yes that help,
but if the turing machine can execute any "program",
that mean it can simulate any other turing machine ,
so that mean any turing machine we can called it universal turing machine!
A Turing machine is not necessarily able to execute any "program". What if the table (δ) is hard-wired? That one program can be swapped out for another is the key distinguishing feature between a universal Turing machine and a plain ordinary Turing machine.
 
D H said:
A Turing machine is not necessarily able to execute any "program". What if the table (δ) is hard-wired? That one program can be swapped out for another is the key distinguishing feature between a universal Turing machine and a plain ordinary Turing machine.
that help,thank you:smile:
 
Thread 'Is this public key encryption?'
I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
Back
Top