Ch11 - Chapters 11 and 12 Decision Problems and...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapters 11 and 12 Decision Problems and Undecidability
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 11.1 Decision Problems A decision problem consists of a set of questions whose answers are either yes or no is undecidable if no algorithm that can solve the problem; otherwise, it is decidable The Church-Turing thesis asserts that a decision problem P has a solution if, and only if, there exists a TM that determines the answer for every p P if no such TM exists, the problem is said to be undecidable An unsolvable problem is a problem such that there does not exist any TM that can solve the problem
Background image of page 2
3 Decision Problems Algorithm L that solves a decision problem should be effective , i.e., Complete : L produces the correct answer (yes/or) to each question Mechanistic : L consists of a finite sequence of instructions Deterministic : L produces the same result for the same input The Church-Turing Thesis for Computable Functions : A function f is effective, i.e., effectively computable, if, and only if, there is a TM that computes f .
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 11.2 Recursive Languages Defn . A recursive language L is a formal language for which there exists a TM that will halt and accept an input string in L , and halt and reject , otherwise. Example 11.2.1 The decision problem of determining whether a natural number is a perfect square (represented by using the string a n ) is decidable. Example 11.2.2 The decision problem of determining whether there is a path P from node v i to a node v j in a directed graph G (with nodes v 1 , …, v n ) using a NTM M with 2-tape is decidable. G is represented over { 0, 1 } as
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 11

Ch11 - Chapters 11 and 12 Decision Problems and...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online