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.
Source: arXiv (Cornell University)
Author: Ramos, Rubens Viana
Institution: Universidade Federal do Ceará
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1649545602
