UNIT-V
Turig Machine variants
Turing machines are powerful computational models that can simulate any
algorithmic process. A standard Turing machine consists of a single tape and a single
read-write head. However, there are variations of Turing machine that have been
developed to address different computational challenges. These variations differ
mainly in structure and operation, but they all have the same computational power as
the standard Turing machine.
1. multi-tape Turing machine
a multi-tape Turing machine is an extension of the standard Turing machine where
multiple tapes are available for input, output, and computation. Each tape has its own
read-write head, and the machine's transition function is based on the current state and
the symbols read by each head.
[Link]-head Turing Machine:
A multi-head Turing machine contains two or more heads to read the symbols on
the same tape.
In one step all the heads sense the scanned symbols and move or write
independently.
Multi-head Turing machine can be simulated by a single head Turing machine.
[Link]-way infinite Tape Turing Machine:
Infinite tape of two-way infinite tape Turing machine is unbounded in both
directions left and right.
Two-way infinite tape Turing machine can be simulated by one-way infinite
Turing machine(standard Turing machine).
[Link]-dimensional Tape Turing Machine:
It has multi-dimensional tape where the head can move in any direction that is
left, right, up or down.
Multi dimensional tape Turing machine can be simulated by one-dimensional
Turing machine
[Link]-deterministic Turing Machine:
A non-deterministic Turing machine has a single, one-way infinite tape.
For a given state and input symbol has at least one choice to move (finite
number of choices for the next move), each choice has several choices of the
path that it might follow for a given input string.
A non-deterministic Turing machine is equivalent to the deterministic Turing
machine.
[Link] Turing Machine (UTM):
A single TM that can simulate any other given Turing machine, making it the
theoretical basis for general-purpose computers.
Undecidability is an important concept in Automata Theory. As per this concept, a
problem cannot be solved by any algorithm, meaning there is no Turing Machine (TM)
that can decide whether a given statement or problem is True or False.
Decidable Problems
A problem is considered decidable if there exists a Turing Machine that can provide a
definitive "yes" or "no" answer for every possible input within a finite amount of time.
In other words, the Turing Machine must halt on every input, either accepting or
rejecting it.
Example − The problem of determining whether a given string is accepted by a
Deterministic Finite Automaton (DFA) is decidable. A Turing Machine can simulate
the DFA and decide whether to accept or reject the string.
Recognizable Problems
A problem is recognizable or Turing Recognizable, if there exists a Turing Machine
that will accept every string in the language but may either reject or run indefinitely
on strings not in the language.
Unlike decidable problems, recognizable problems do not guarantee that the machine
will halt for all inputs or not.
Undecidable Problems
A problem is considered undecidable if no Turing Machine can be constructed that
will always halt with a correct "yes" or "no" answer for every input. In other words,
there is no algorithm that can decide the problem in all cases.
Example − The Halting Problem, which asks whether a given Turing Machine will
halt on a given input, is a classic example of an undecidable problem.
The Halting Problem
The Halting Problem is one of the most well-known undecidable problems. It asks
whether a Turing Machine, for a given input, will halt (stop executing) or continue to
run forever.
Proof of Undecidability
Suppose there is a Turing Machine H that can decide the Halting Problem. Now,
construct a new Turing Machine D that does the following −
For an input x, if H(x, x) (where x is both the machine and input) halts, D(x) will run
indefinitely.
If H(x, x) does not halt, then D(x) will halt.
This leads to a contradiction because if D runs on its own description, it both halts and
does not halt. Therefore, H cannot exist, proving that the Halting Problem is
undecidable.
The Post Correspondence Problem (PCP)
Another interesting problem is the Post Correspondence Problem; it is about finding a
match between two lists of strings. We have two lists of strings, the question is
whether there is a sequence of indices that, when applied to both lists, produces the
same string.
Proof of Undecidability
The undecidability of PCP is proven by reducing it to another undecidable problem.
Suppose there exists a solution to PCP, then it can be used to solve the Halting
Problem, which we know is undecidable. Since solving the Halting Problem is
impossible, PCP must also be undecidable.
The Blank Tape Halting Problem
Another example of undecidability is the Blank Tape Halting Problem, which asks
whether a Turing Machine will halt when started with a blank tape.
Proof of Undecidability
The problem is reduced from the Halting Problem. If we could decide whether a
Turing Machine halts on a blank tape, we could decide whether it halts on any
arbitrary input. However, since the Halting Problem is undecidable, the Blank Tape
Halting Problem is also undecidable.
The Virus Detection Problem
Another interesting problem is Virus Detection Problem which is also undecidable. It
asks whether there exists an algorithm that can decide if a program is a virus or not.
Proof of Undecidability
If a virus detection program could perfectly identify whether a program halts (runs to
completion) or runs indefinitely (spreads like a virus), it could be used to solve the
Halting Problem. However, since the Halting Problem is undecidable, virus detection
is also undecidable.
Turing machine and Halting Problem
Post correspondence problem
