## What does it mean for a problem to be undecidable?

Table of Contents

## What does it mean for a problem to be undecidable?

An undecidable problem is one that should give a “yes” or “no” answer, but yet no algorithm exists that can answer correctly on all inputs.

## How do you prove language Undecidability?

How can you prove a language is undecidable? To prove a language is undecidable, need to show there is no Turing Machine that can decide the language.

**Why is the halting problem unsolvable?**

Rice’s theorem generalizes the theorem that the halting problem is unsolvable. It states that for any non-trivial property, there is no general decision procedure that, for all programs, decides whether the partial function implemented by the input program has that property.

**What do you mean by undecidability?**

: not capable of being decided : not decidable …

### How do you show a language is unrecognizable?

To prove that a given language is non-Turing-recognizable: Either do both of these: • Prove that its complement is Turing-recognizable. Prove that its complement is undecidable.

### How do you know if its undecidable or decidable?

Explain the Decidable and undecidable problems

- Decidable Language. A language L is called decidable if there is a decider M such that L( M) = L.
- Undecidable Language. A decision problem P is undecidable if the language L of all yes instances to P is not decidable.
- Problem.
- Solution.
- The proof is by contradiction.

**Can human solve the halting problem?**

Originally Answered: Can human brain solve turing halting problem? No, your brain can’t solve the Halting Problem.

**Can a quantum computer solve the halting problem?**

No, quantum computers (as understood by mainstream scientists) cannot solve the halting problem. We can already simulate quantum circuits with normal computers; it just takes a really long time when you get a decent number of qubits involved. (Quantum computing provides exponential speedups for some problems.)