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

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

2001-06-12

arxiv.org/abs/math/0106096v1

Mathematics

Logic

LaTeX

Scientific paper

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 counterexample function when defined over the
so-called Baker-Gill-Solovay (BGS) set of poly machines? We state and prove
here a lemma that tries to answer this query.

Affiliated with

Also associated with

No associations

Rating

A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507329