Using Disentangled States and Algorithmic Information Theory to   Construct a Not P Problem
  In this work, are used Chaitin number Omega and the fact that the general decomposition of an N-way disentangled state is an irreducible sentence whose number of coefficients grows in a non-polynomial way with N, to construct a problem that can never be solved in P. 
Rubens Viana Ramos