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

Simple item page
dc.creatorda Costa, N. C. A.
dc.creatorDoria, F. A.
dc.date2001-06-12
dc.date.accessioned2026-07-07T04:42:07Z
dc.date.available2026-07-07T04:42:07Z
dc.descriptionIf 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.
dc.descriptionLaTeX
dc.identifierhttps://arxiv.org/abs/math/0106096
dc.identifierhttp://arxiv.org/abs/math/0106096
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61639
dc.subjectLogic
dc.titleA lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines
dc.typetext

Files

Collections

arXiv