Jump to content

Qualification problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 70.167.35.90 (talk) at 13:54, 26 March 2009 (zeno solutions and qualification). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In philosophy and AI (especially, knowledge based systems), the qualification problem is concerned with the impossibility of listing all the preconditions required for a real-world action to have its intended effect. It might be posed as how to deal with the things that prevent me from achieving my intended result. It is strongly connected to, and opposite the ramification side of, the frame problem. John McCarthy gives the following motivating example, in which it is impossible to enumerate all the circumstances that may prevent a rowboat from performing its ordinary function:

"[T]he successful use of a boat to cross a river requires, if the boat is a rowboat, that the oars and rowlocks be present and unbroken, and that they fit each other. Many other qualifications can be added, making the rules for using a rowboat almost impossible to apply, and yet anyone will still be able to think of additional requirements not yet stated."

From an operational sense, measurement and algorithmic theory played heavily in computational success of disciplines, such as Knowledge-based engineering. By judicious application of insights from Weierstrass, situations that could be labeled as Zeno-like [1] can be avoided if numerics stability can be maintained. Where the focus is beyond numerics, many situations are still problematic, though, and demand inordinate attention.

References

See also