Costas Busch - RPI1 Decidability. Costas Busch - RPI2 Consider problems with answer YES or NO Examples: Does Machine have three states ? Is string a binary.

Slides:

Advertisements

Similar presentations

Linear Bounded Automata LBAs

Advertisements

1 Section 14.1 Computability Some problems cannot be solved by any machine/algorithm. To prove such statements we need to effectively describe all possible.

Computability and Complexity 5-1 Classifying Problems Computability and Complexity Andrei Bulatov.

Fall 2004COMP 3351 Undecidable problems for Recursively enumerable languages continued…

Prof. Busch - LSU1 Decidable Languages. Prof. Busch - LSU2 Recall that: A language is Turing-Acceptable if there is a Turing machine that accepts Also.

Fall 2006Costas Busch - RPI1 Regular Expressions.

Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.

Costas Busch - RPI1 Undecidable problems for Recursively enumerable languages continued…

Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)

Fall 2006Costas Busch - RPI1 Deterministic Finite Automata And Regular Languages.

Recursively Enumerable and Recursive Languages

1 The Chomsky Hierarchy. 2 Unrestricted Grammars: Rules have form String of variables and terminals String of variables and terminals.

1 Uncountable Sets continued Theorem: Let be an infinite countable set. The powerset of is uncountable.

Fall 2006Costas Busch - RPI1 The Post Correspondence Problem.

Fall 2004COMP 3351 The Chomsky Hierarchy. Fall 2004COMP 3352 Non-recursively enumerable Recursively-enumerable Recursive Context-sensitive Context-free.

Fall 2003Costas Busch - RPI1 Decidable Problems of Regular Languages.

Fall 2004COMP 3351 Reducibility. Fall 2004COMP 3352 Problem is reduced to problem If we can solve problem then we can solve problem.

Costas Busch - RPI1 Standard Representations of Regular Languages Regular Languages DFAs NFAs Regular Expressions Regular Grammars.

Linear Bounded Automata LBAs

Fall 2006Costas Busch - RPI1 Properties of Regular Languages.

Homework #9 Solutions.

1 Decidability continued. 2 Undecidable Problems Halting Problem: Does machine halt on input ? State-entry Problem: Does machine enter state halt on input.

Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 5 Reducibility Contents Undecidable Problems from Language Theory.

Fall 2006Costas Busch - RPI1 Non-Deterministic Finite Automata.

Fall 2005Costas Busch - RPI1 Recursively Enumerable and Recursive Languages.

Courtesy Costas Busch - RPI1 Reducibility. Courtesy Costas Busch - RPI2 Problem is reduced to problem If we can solve problem then we can solve problem.

Costas Busch - RPI1 CSCI-2400 Models of Computation.

Fall 2006Costas Busch - RPI1 The Chomsky Hierarchy.

Finite Automata Costas Busch - RPI.

Fall 2006Costas Busch - RPI1 Undecidable Problems (unsolvable problems)

Fall 2003Costas Busch - RPI1 Turing Machines (TMs) Linear Bounded Automata (LBAs)

Prof. Busch - LSU1 Undecidable Problems (unsolvable problems)

Prof. Busch - RPI1 Decidable Problems of Regular Languages.

Prof. Busch - LSU1 Reductions. Prof. Busch - LSU2 Problem is reduced to problem If we can solve problem then we can solve problem.

1 Reducibility. 2 Problem is reduced to problem If we can solve problem then we can solve problem.

Decidability A decision problem is a problem with a YES/NO answer. We have seen decision problems for - regular languages: - context free languages: [Sections.

Fall 2006Costas Busch - RPI1 Deterministic Finite Automaton (DFA) Input Tape “Accept” or “Reject” String Finite Automaton Output.

1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.

1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)

Costas Busch - LSU1 Time Complexity. Costas Busch - LSU2 Consider a deterministic Turing Machine which decides a language.

Recursively Enumerable and Recursive Languages

1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.

1 The Chomsky Hierarchy. 2 Unrestricted Grammars: Productions String of variables and terminals String of variables and terminals.

Costas Busch - LSU1 The Post Correspondence Problem.

Prof. Busch - LSU1 Time Complexity. Prof. Busch - LSU2 Consider a deterministic Turing Machine which decides a language.

Costas Busch - RPI1 Decidability. Costas Busch - RPI2 Another famous undecidable problem: The halting problem.

Recursively Enumerable and Recursive Languages. Definition: A language is recursively enumerable if some Turing machine accepts it.

Fall 2006Costas Busch - RPI1 RE languages and Enumerators.

Recursively Enumerable and Recursive Languages

Time Complexity Costas Busch - LSU.

Busch Complexity Lectures: Reductions

Linear Bounded Automata LBAs

FORMAL LANGUAGES AND AUTOMATA THEORY

Undecidable Problems Costas Busch - LSU.

Reductions Costas Busch - LSU.

Busch Complexity Lectures: Undecidable Problems (unsolvable problems)

Undecidable Problems (unsolvable problems)

Turing acceptable languages and Enumerators

CSCI-2400 Models of Computation Costas Busch - RPI.

Decidable Languages Costas Busch - LSU.

The Post Correspondence Problem

A Universal Turing Machine

Decidable Problems of Regular Languages

Turing acceptable languages and Enumerators

Undecidable problems:

Properties of Context-Free languages

Decidability continued….

Formal Definitions for Turing Machines

Presentation transcript:

Costas Busch - RPI1 Decidability

Costas Busch - RPI2 Consider problems with answer YES or NO Examples: Does Machine have three states ? Is string a binary number? Does DFA accept any input?

Costas Busch - RPI3 A problem is decidable if some Turing machine decides (solves) the problem Decidable problems: Does Machine have three states ? Is string a binary number? Does DFA accept any input?

Costas Busch - RPI4 Turing Machine Input problem instance YES NO The Turing machine that decides (solves) a problem answers YES or NO for each instance of the problem

Costas Busch - RPI5 The machine that decides (solves) a problem: If the answer is YES then halts in a yes state If the answer is NO then halts in a no state These states may not be final states

Costas Busch - RPI6 YES states NO states Turing Machine that decides a problem YES and NO states are halting states

Costas Busch - RPI7 Difference between Recursive Languages and Decidable problems The YES states may not be final states For decidable problems:

Costas Busch - RPI8 Some problems are undecidable: which means: there is no Turing Machine that solves all instances of the problem A simple undecidable problem: The membership problem

Fall 2006Costas Busch - RPI9 Undecidable Problems (unsolvable problems)

Fall 2006Costas Busch - RPI10 Undecidable Languages there is no Turing Machine which accepts the language and makes a decision (halts) for every input string undecidable language = not decidable language There is no decider: (machine may make decision for some input strings)

Fall 2006Costas Busch - RPI11 For an undecidable language, the corresponding problem is undecidable (unsolvable): there is no Turing Machine (Algorithm) that gives an answer (yes or no) for every input instance (answer may be given for some input instances)

Fall 2006Costas Busch - RPI12 We have shown before that there are undecidable languages: Decidable Turing-Acceptable is Turing-Acceptable and undecidable

Fall 2006Costas Busch - RPI13 We will prove that two particular problems are unsolvable: Membership problem Halting problem