N. Costa

activity

19982021

most citedOn a total function which overtakes all total recursive functions

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing math.LOShow all

3 papers · 1 filter

math.LO2001★ 1 cited

On a total function which overtakes all total recursive functions

N. C. A. da Costa, F. A. Doria

This paper discusses a function that is frequently presented as a simile or look-alike of the so-called ``counterexample function to P=NP,'' that is, the function that collects all…

math.LO2001

A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines

N. C. A. da Costa, F. A. Doria

If we establish that the counterexample function for P=NP, if total, overtakes all total recursive functions when extended over all Turing machines, then what happens to the same c…

math.LO2000★ 1 cited

On the consistency of $P = N P$ with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment

N. C. A. da Costa, F. A. Doria

We formulate the $P < N P$ hypothesis in the case of the satisfiability problem as a $Π_{2}^{0}$ sentence, out of which we can construct a partial recursive function $f_{\neg A}$ so that…

On a total function which overtakes all total recursive functions

A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines

On the consistency of P=NP with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment

On the consistency of $P = N P$ with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment