## Which of the problem is a Decidable problem?

Definition: A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. See also undecidable problem, NP, NP-complete, solvable, tractable, computable. …

### What are the undecidable problems about Turing machine?

Undecidable Problems A problem is undecidable if there is no Turing machine which will always halt in finite amount of time to give answer as ‘yes’ or ‘no’. An undecidable problem has no algorithm to determine the answer for a given input.

**When a problem is un Decidable?**

The problems for which we can’t construct an algorithm that can answer the problem correctly in the infinite time are termed as Undecidable Problems in the theory of computation (TOC). A problem is undecidable if there is no Turing machine that will always halt an infinite amount of time to answer as ‘yes’ or ‘no’.

**What is decidable and Undecidable Problems?**

A decision problem is decidable if there exists a decision algorithm for it. Otherwise it is undecidable. To show that a decision problem is decidable it is sufficient to give an algorithm for it.

## What are Turing machines in TOC?

A Turing machine is a computational model, like Finite Automata (FA), Pushdown automata (PDA), which works on unrestricted grammar. The Turing machine is the most powerful computation model when compared with FA and PDA.

### When we say a problem is decidable give an example of undecidable problem?

Give an example of undecidable problem? algorithm that takes as input an instance of the problem and determines whether the answer to that instance is “yes” or “no”. (eg) of undecidable problems are (1)Halting problem of the TM.

**What is unsolvable problem?**

(definition) Definition: A computational problem that cannot be solved by a Turing machine. The associated function is called an uncomputable function. See also solvable, undecidable problem, intractable, halting problem.

**What is decidable and UN Decidable problems?**

## Can Turing machine solve all problems?

Turing machiens are significantly more powerful than the automata we have examined so far. In fact, they solve precisely the set of all problems thant can be solved by any digital computing device.

### How can you prove that a Turing machine is decidable?

Prove that the language it recognizes is equal to the given language and that the algorithm halts on all inputs. To prove that a given language is Turing-recognizable: Construct an algorithm that accepts exactly those strings that are in the language. It must either reject or loop on any string not in the language.