What's the difference between Turing Machine and UTM?

Click For Summary
SUMMARY

The discussion clarifies the distinction between a Turing Machine (TM) and a Universal Turing Machine (UTM). A Turing Machine is designed for specific calculations, such as adding numbers, while a Universal Turing Machine can simulate any Turing Machine by taking encoded input that specifies the machine and its task. This capability allows the UTM to perform a variety of computations, establishing a foundational concept in theoretical computer science. The Church-Turing thesis supports the idea that any computation feasible on a computer can also be executed by a Turing Machine.

PREREQUISITES
  • Understanding of Turing Machines and their operations
  • Familiarity with the Church-Turing thesis
  • Basic knowledge of computational theory
  • Awareness of encoding methods for Turing Machines
NEXT STEPS
  • Research the Church-Turing thesis and its implications in computer science
  • Explore the concept of encoding Turing Machines for simulation
  • Learn about the practical applications of Turing Machines in theoretical contexts
  • Investigate the differences between Turing Machines and unlimited register machines
USEFUL FOR

This discussion is beneficial for students and professionals in computer science, particularly those interested in theoretical computing, computational theory, and the historical development of algorithms.

xeon123
Messages
90
Reaction score
0
1 - I'm trying to see what's the difference between a Turing Machine and a universal Turing Machine. Aren't the same?

2 - If I have a Touring Machine that to solve a problem, for example, adding numbers, what is the purpose of a Universal Touring Machine?
 
Mathematics news on Phys.org
First, it is "Turing" rather than the "Touring" you have in a few places (I know- your fingers just want to go to the letters of more familiar words!). They are named for British mathematician Alan Turing.

A Turing Machine is a conceptual system for doing a particular calculation such as adding two numbers. A "universal Turing machine" is, just as the name would imply, a much more general system in which part of the input would tell the machine if it was to add, multiply, or something else.
 
A Turing machine takes an input string and according to its internal workings either produces an output string and halts, or calculates forever. As mentioned above, this kind of machine can be used to do things like adding numbers, finding circuits in graphs, and indeed (theoretically) anything that can be suitably represented and solved by a step by step procedure (this the Church-Turing thesis). A universal Turing machine 'U' is a special kind of Turing machine that takes as input a string containing both another Turing machine, T say, (in coded form - to define a UTM we require a method of encoding every TM uniquely), and another input string 'I'. U operates by simulating T on I, and its output (or failure to halt) will mimic exactly the output (or failure to halt) of T acting on I.

Turing machines don't solve practical problems, and I believe real computers are more closely related to unlimited register machines in the way they operate in practice (in theory though any calculation you can do on a computer you can do with a TM). You'll never meet a problem that you need a UTM to solve (unless you are working in theoretical computer science), but they provide a theoretical basis for general computing, that is, computers that can run different programs to do different things. Here in 2012 this is hardly surprising, as we have real computers that do exactly that, but in 1936 this was a profound idea.
 

Similar threads

Replies
29
Views
5K
  • · Replies 2 ·
Replies
2
Views
905
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K