A trivial solution to the PvNP problem
Bhupinder Singh Anand · FCS · 2008
We show that Godel has dened an arithmetical relation R(n) which| when treated as a Boolean function|is constructively computable as true for any given natural number n, but which is not Turing-computable as true for any given natural number n. This implies that the current for- mulation of the PvNP problem admits a trivial logical solution that is not signicant computationally.