Halting problem in TOC

1. HALTING PROBLEM OF TURING MACHINE
COMPUTABILITY AND DECIDABILITY

2. COMPUTABILITYAND DECIDABILITY
 A function is said to be computable if there exists a Turing machine M such that
it computes the value of the function f for all arguments. The Turing machine
computes the function on the whole but not a part of the domain.
 A function is said to be uncomputable if there exists no such Turing machine.
 A problem is said to be ‘decidable’ or ‘undecidable’ depending on the result of
computation ‘yes’ or ‘no’. A class of problems is said to be decidable if there
exists some algorithm that halts(terminates) with two outputs either ‘true’ or
‘false’. Otherwise, it is said to be undecidable.
 Problems that can be solved by Turing machine are divided into two classes.
The first problem is the Turing machine halting problem, which is undecidable.

3. LANGUAGE DECIDABILITY
 A language is called Decidable or Recursive if there is a Turing
machine which is accepts and halts on every input string w.
 Every decidable language is Turing-Acceptable.

9. THANK YOU