Knowledge Recognition Algorithm enables P = NP

Details Knowledge Recognition Algorithm enables P = NP Knowledge Recognition Algorithm enables P = NP

2010-09-05

arxiv.org/abs/1009.0884v1

Computer Science

Computational Complexity

Scientific paper

This paper introduces a knowledge recognition algorithm (KRA) that is both a Turing machine algorithm and an Oracle Turing machine algorithm. By definition KRA is a non-deterministic language recognition algorithm. Simultaneously it can be implemented as a deterministic Turing machine algorithm. KRA applies mirrored perceptual-conceptual languages to learn member-class relations between the two languages iteratively and retrieve information through deductive and reductive recognition from one language to another. The novelty of KRA is that the conventional concept of relation is adjusted. The computation therefore becomes efficient bidirectional string mapping.

Affiliated with

Also associated with

No associations

Rating

Knowledge Recognition Algorithm enables P = NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Knowledge Recognition Algorithm enables P = NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knowledge Recognition Algorithm enables P = NP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473657