P and NP are sets; I wonder if category theory (which puts structure on sets) and information theory would be useful in proving P != NP.
in [Theory]
|
Prev: [] semi-Hamiltonian paths in planar triangulations
Next: Relationship between transactions and workflows
From: Casey Hawthorne on 16 Jun 2010 00:47 P and NP are sets; I wonder if category theory (which puts structure on sets) and information theory would be useful in proving P != NP. -- Regards, Casey |