Knowledge Recognition Algorithm enables P = NP

TL;DR

This paper proposes a knowledge recognition algorithm (KRA) that can operate as both a Turing machine and an Oracle, claiming to demonstrate that P equals NP through efficient bidirectional string mapping.

Contribution

It introduces a novel KRA that combines deterministic and non-deterministic recognition, enabling efficient bidirectional language mapping and addressing the P vs NP problem.

Findings

KRA functions as both a Turing and Oracle machine.

KRA achieves efficient bidirectional string mapping.

Claims to prove P = NP.

Abstract

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.