[Home]Wpc/decision problem

HomePage | Wpc | Recent Changes | Preferences

Difference (from prior major revision) (minor diff)

Changed: 5c5
Equivalently, a computational problem for which the goal is to determine whether an input string belongs in a particular formal language.
Equivalently, a computational problem for which the goal is to determine whether an input string belongs to a particular formal language.

Changed: 11,13c11,13
solvability:
* [unsolvable decision problem]?
* [solvable decision problem]?
computability:
* [undecidable problem]?
* decidable problem

Changed: 16,17c16,18
* computationally tractable decision problem
* computationally intractable decision problem
* computationally tractable decision problem (is in P)
* nondeterministically computationally tractable decision problem (is in NP)
* computationally intractable decision problem (is not in P)

Changed: 21c22
Nothing yet
* decidable language

Definition:

A computational problem which requires a yes/no answer.

Equivalently, a computational problem for which the goal is to determine whether an input string belongs to a particular formal language.

Generalizations:

Specializations:

computability:

difficulty:

Involved in:


Relevant Wikipedia Articles:

the concept- decision problem

related field(s)- theory of computation

potential real-world examples-


/Discussion?

HomePage | Wpc | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited October 23, 2001 1:26 am by Seb (diff)
Search: