delphi is a set of rules for solving a mathematical or computational problem in finite number of steps.
set of rules for solving a mathematical or computational problem in finite number of steps?
delphi
computational problem









































in theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve. for example, the problem of factoring









































is a computational problem. computational problems are one of the main objects of study in theoretical computer science. the field of algorithms studies methods of solving computational problems efficiently. the complementary field of computational complexity attempts to explain why certain computational problems are intractable for computers.
computational problem
a computational problem can be viewed as an infinite collection of "instances" together with a "solution" for every instance. the input string for a computational problem is referred to as a problem instance, and should not be confused with the problem itself. in computational complexity theory, a problem refers to the abstract question to be solved. in contrast, an instance of this problem is a rather concrete utterance, which can serve as the input for a decision problem. for example, consider the problem of primality testing. the instance is a number (e.g., 15) and the solution is "yes" if the number is prime and "no" otherwise (in this case, 15 is not prime and the answer is "no"). stated another way, the "instance" is a particular input to the problem, and the "solution" is the output corresponding to the given input.
computational complexity theory