Programmability and P=NP conjecture

  • S. Radziszowski
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


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.


Turing Machine Relational System Binary Representation Choice Statement Programmable Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho. Hopcroft, Ullman — The Design and Analysis of Computer Algorithms — Addison, Wesley 1974.Google Scholar
  2. [2]
    Salwicki — Programmability and Recursiveness, Dissertationes Mathematicae /to appear/.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • S. Radziszowski
    • 1
  1. 1.Institute of InformaticsUniversity of WarsawPKiN WarszawaPoland

Personalised recommendations