Knowledge Recognition Algorithm enables P = NP
نویسنده
چکیده
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 R ⊆ {Σ x Σ} is adjusted to R ⊆ {Σ
منابع مشابه
Mirrored Language Structure and Innate Logic of the Human Brain as a Computable Model of the Oracle Turing Machine
We wish to present a mirrored language structure (MLS) and four logic rules determined by this structure for the model of a computable Oracle Turing machine. MLS has novel features that are of considerable biological and computational significance. It suggests an algorithm of relation learning and recognition (RLR) that enables the deterministic computers to simulate the mechanism of the Oracle...
متن کاملStrip Exchanging Is Hard
The sorting by strip exchanges (aka strip exchanging) problem is motivated by applications in optical character recognition and genome rearrangement analysis. While a couple of approximation algorithms have been designed for the problem, nothing has been known about its computational hardness till date. In this work, we show that the decision version of strip exchanging is NP-Complete. We prese...
متن کاملNP versus P : A proof that NP is not equaled to P
This proof of P ≠ NP is based on better estimates of lower bounds on the time complexity that hold for all solution algorithms. Almost no special knowledge is needed to understand the proof. A short review of the main steps and ideas of the proof can be seen in the Introduction below.
متن کاملIdentify enablers of agility and agile modeling strategy with neural network approach
The electronic industry suffers a rapid changing and highly rival environment. Thus, firms have an essential need to strive for acquiring the competitive advantage. Strategy Organizational Agility (SOA) is a tool which enables to assist firms to attain the competitive advantage. Therefore, this study benchmarks the core competencies from a case study within the supply chain network and establis...
متن کاملOn the strong p-Helly property
The notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, J. Combin. Theory Ser. B 38 (1985) 8–22]. Independently, other authors [A. Bretto, S. Ubéda, J. Žerovnik, A polynomial algorithm for the strong Helly property. Inform. Process. Lett. 81 (2002) 55–57, E. Prisner, Hereditary clique-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1009.0884 شماره
صفحات -
تاریخ انتشار 2010