Scribd
Upload
101 views2 pages

Universal Turing Machine

Uploaded by

gauryashu9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views2 pages

Universal Turing Machine

Uploaded by

gauryashu9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Difference between Turing machine and

Universal Turing machine


Turing Machine was first described by Alan Turing in the year 1936. It was
primarily invented to investigate the computability of a given problem. It accepts
type-0 grammar which is Recursively Enumerable language. The Turing machine
has a tape of infinite length where we can perform read and write operations.
The infinite cells of the Turing machine can contain input symbols and blanks. It
has a head pointer that can move in any direction, it points to the cell where the
input is being read.
Universal Turing Machine simulates a Turing Machine. Universal Turing
Machine can be considered as a subset of all the Turing machines, it can match or
surpass other Turing machines including itself. Universal Turing Machine is like a
single Turing Machine that has a solution to all problems that is computable. It
contains a Turing Machine description as input along with an input string, runs
the Turing Machine on the input and returns a result.

The difference between Turing Machine and Universal Turing Machine are as
follows:

Turing Machine Universal Turing Machine

It is a mathematical model of
Universal Turing Machine is like a single
computation it manipulates
1. Turing Machine that has a solution to all
symbols on the tape according to
problem that is computable
the rules defined

A program can be compared to a Programmable Turing Machine is called


2.
Turing Machine Universal Turing Machine

Turing machine’s temporary Universal Turing Machine contains Turing


storage is tape. The infinite cells of Machine description as input along with an
3.
the Turing machine can contain input string, runs the Turing Machine on
input symbols and blanks. the input and returns the result.

Turing machines help us


Although developed for theoretical
understand the fundamental
4. reasons, it helped in the development of
limitations of mechanical
stored program computers
computation power
A Turing machine is a formal
Universal Turing Machine provides a
5. model of a computer with a fixed
solution to problems that are computable
program

It does not minimize the space


6. It minimizes space complexity
complexity

Transition function which Turing


The transition function is Q × T → Q × T
Machine performs is defined as: δ
7, × {L, R}, where Q is a finite set of states,
X T -> Q X T X {L,R}, where δ is
T is the tape of the alphabet
the transition function

In the set theory point of view, all


Turing machines form a set of the Universal Turing Machine is a subset of all
8.
all the device that accepts type 0 the Turing Machines
grammar

You might also like