Programmability and P=NP conjecture
We define the time complexity of programs in an arbitrary relational system. We extend these notions to nondeterministic programs. There are certain sufficient conditions for a relational system which ensure the equivalence of the P=NP problem in that system to the classical P=NP problem for Turing machines. This implies that the problem can be solved in the theory of programs in some relational systems.
KeywordsTuring Machine Relational System Binary Representation Choice Statement Programmable Relation
Unable to display preview. Download preview PDF.