Undecidable problems about turing machines

4/24/12

Click to edit Master subtitle style

halting

Introduction

How to decide a problem if it is undecided ?

4/24/12

Turing machine

the control unit reads the current tape symbol, writes a symbol on the tape,

A Turing machine is a primitive, yet general, computer with an infinite tape. In each cycle:

moves one position to the left or right, and switches to the next state.

4/24/12 The last three actions depend on the

Turing Machine Model

4/24/12

Turing machine undecidable problem

Turing machine is a 7-tuple [1]: (Q, , , , q0, B, F), where Q, , , are all finite sets and: Q is the set of states. is the input alphabet not containing the special blank symbol. is the tape alphabet not containing the special blank symbol, where . : Q x Q x x {L, R} is the transition 4/24/12 function.

Turing machine undecidable problem

They are several problems, that a Turing Machine cannot solve such as
Halting problem P=NP Membership etc.

4/24/12

Halting Problem

Difficulty with the Turing Machine

Not

guaranteed to terminate Dont know when it will terminate

Still an unsolved problem

Is

there a method for analyzing a Turing machine to determine if and when it will terminate its computation? It is a famous problem because it, became the first problem that proof to be undecideble through an algorithm.
4/24/12

Halting Problem (Introduction)

The Halting Problem for Turing machines is to decide whether an arbitrary Turing machine M eventually halts on an arbitrary input x. As a Turing machine M can be coded by a finite stringsay, code(M)one can ask whether there is a Turing machine Mhalt which, given code(M) and the input x, eventually stops and produces 1 if M(x)stops, and 0 if M(x) does not stop. 4/24/12

Issue

HOW TO DETERMINE THAT THE HALTING PROBLEM IS UNDECIDEBLE

4/24/12

Contradiction theory

Theorem 1: The Halting problem of Turing machine is unsolvable.

Proof: The proof is by contradiction, that is, assume that the Halting problem is solvable and then find a contradiction. If the Halting problem is solvable, then there must be a Turing machine to decide the Halting problem (Church thesis), that is, the Turing machine H exists. Then, if H can solve the Halting problem for input e(M)&x it should be able to solve the Halting problem for 4/24/12

(The halting problem is unsolvable)

Theorem: HALT Basic idea

Suppose

TM

is undecidable

that is decidable; we HALTTM will prove that every decidable language is also Turing-Acceptable

A contradiction!
4/24/12

Halting Problem Statement

Is this machine(program) when it is given an input it will STOP and say YES or it doesnt STOP (infinite loop) Input {any string} TM Output STOP and yes I accept that input DONT STOP and it go into and infinite loop HOW TO DETERMINE THAT THE MECHINE WILL GO INTO THE INFINITE LOOP (in 4/24/12 advance)

HALTTM Suppose that decidable

Inpu t stri ng ,w M

is

M
w

Decider for

HALTTM

YE M w S N M doesnt halt w O on input

4/24/12

halts on input

ML

Decider L Decider for

HALTTM for
?

s
Input strin g

ML halts on s

N O YE S
halts and accepts halts and rejects

reje and ct
halt
ML

RunML with input

acce s and pt
halt

ML

reje and ct
halt

4/24/12

Therefo L is re, decidable SinceL is chosen arbitrarily, every

Turing-Acceptable language is decidable

But there is a Turing-Acceptable language which is undecidable.

Contradicti on!!!!

END OF PROOF
4/24/12

The answer

THERE IS NO MATHEMATIC TO DO IT , THATS WHY IS CALL UNDECIDEBLE

4/24/12