Work

Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem

Year: 2006
Type: preprint
Abstract: 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.
Language: English
Open Access status: green
OpenAlex ID: W1649545602
Cites: 10
Cited by: 1
Related to: 10