| Computational Problems |
Article Index for Computational |
Website Links For Computational |
Information AboutComputational Problems |
| CATEGORIES ABOUT COMPUTATIONAL PROBLEM | |
| computational problems | |
| SHOPPER'S DELIGHT | |
|
PROBLEMS AND INSTANCES A computational problem encodes a general problem, independent of its specific input. A problem with a specific set of inputs is called an Instance . For example, "Given any two numbers ''x'' and ''y'', find the sum of ''x'' and ''y''" is a computational problem. A specific ''instance'' of that computational problem would be "What is the sum of 13 and 28?". FORMAL DEFINITION A formal definition of computational problems probably exists, and would be helpful. TYPES OF COMPUTATIONAL PROBLEMS Computational problems are organized in many different ways. They can be organized by how they are defined, and by how many Computational Resources are needed to compute an answer. Computational problems that intuitively look very similar can vary wildly in the amount of resources needed to compute them, and some computational problems are Noncomputable , meaning that no possible algorithm could solve every instance. A computational problem which only returns a yes-or-no answer is called a Decision Problem . Examples of decision problems include "given an integer ''n'', determine whether ''n'' is prime" and "given two numbers ''x'' and ''y'', determine whether ''x'' evenly divides ''y''". Decision problems are often used in computational complexity theory, because they are easier to study than other problems. Computational problems that are not restricted to yes-or-no answers are called Function Problem s. Examples of function problems include "given an integer ''n'', list the Prime Factorization of ''n''" and "given two numbers ''x'' and ''y'', output ''x'' divided by ''y''". |