The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence
Computational Complexity
2007-07-13 v2 Information Theory
math.IT
Abstract
In this short communication it is discussed the relation between disentangled states and algorithmic information theory aiming to construct an irreducible sentence whose length increases in a non-polynomial way when the number of qubits increases.
Cite
@article{arxiv.cs/0611081,
title = {The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence},
author = {Rubens Viana Ramos},
journal= {arXiv preprint arXiv:cs/0611081},
year = {2007}
}
Comments
2 pages