Talk:Qualification problem

This article is within the scope of WikiProject Philosophy, a collaborative effort to improve the coverage of content related to philosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join the general discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy

Stub

This article has been rated as Stub-class on Wikipedia's content assessment scale.

???

This article has not yet received a rating on the project's importance scale.

Associated task forces:
/
	Logic

Solution(s) to the qualification problem

Is this article an accepted solution to the qualification problem doi:10.1016/S0004-3702(01)00131-X? pgr94 (talk) 11:08, 2 October 2008 (UTC)[reply]

Yes, but it could be better. USER:JMSwtlk —Preceding unsigned comment added by 70.167.35.90 (talk) 13:56, 26 March 2009 (UTC)[reply]

Literalism

The following was edited out under the guise of literalism which I would argue non-monotonic methods were meant to resolve, in part. It is placed here until better support can be established for its original inclusion; this is under the guise of avoiding aspersions of neo-logicism. [Another example]

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 Zeno solutions, et al 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.

Note, please, use of zeno in context that would deal with resolving shape, motion, and other physical aspects of the problem illustrated (to wit, over qualification) on this page. Who said that non-monotonic techniques apply only to text-based problems? jmswtlk (talk) 16:40, 25 July 2009 (UTC)[reply]