Can a Turing Machine Execute Multiple Programs?

In summary, the conversation discusses the capabilities of a Turing machine and whether it can execute multiple programs or just one hardwired program. The concept of a universal Turing machine is also mentioned, which is able to simulate any other Turing machine. The key difference between a universal Turing machine and a regular one is the ability to swap out programs.
  • #1
samaaa
48
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
  • #2
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?
 
  • #3
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!
 
  • #5
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.
 
  • #6
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:
 

1. What is a Turing machine?

A Turing machine is a theoretical mathematical model that was developed by Alan Turing in the 1930s. It consists of a tape, a read/write head, and a set of rules that dictate how the machine operates. It is considered to be the basis of modern computing and has greatly influenced the development of computer science.

2. How does a Turing machine work?

A Turing machine works by reading and writing symbols on a tape based on a set of rules. It starts at a designated starting point on the tape and follows the rules to manipulate the symbols on the tape. The machine can also move left or right on the tape depending on the rules and the current state of the machine.

3. What are the limitations of a Turing machine?

A Turing machine is a theoretical model and is not physically realizable. It can only perform one operation at a time and has a limited amount of memory on its tape. Also, it is unable to solve problems that require infinite memory or time.

4. How does a Turing machine differ from a modern computer?

A Turing machine is a theoretical model while a modern computer is a physical device. A Turing machine has an infinite tape and can only perform one operation at a time, while a modern computer has limited storage and can perform multiple operations simultaneously. Additionally, a modern computer has a user interface, input/output devices, and an operating system, while a Turing machine only operates based on its set of rules.

5. What are some real-world applications of Turing machines?

Although Turing machines are not physically realizable, they have greatly influenced the development of modern computers and computer science. Concepts from Turing machines are used in the design and analysis of algorithms, programming languages, and computer architecture. They also play a role in the study of computability and complexity theory, which are important areas in mathematics and computer science.

Similar threads

  • Programming and Computer Science
Replies
29
Views
2K
  • Programming and Computer Science
Replies
2
Views
1K
Replies
2
Views
861
  • Programming and Computer Science
Replies
10
Views
2K
  • Computing and Technology
Replies
9
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
14
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Programming and Computer Science
Replies
14
Views
1K
  • Programming and Computer Science
Replies
2
Views
2K
  • Programming and Computer Science
Replies
2
Views
1K
Back
Top