On a total function which overtakes all total recursive functions

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.descriptionThis 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 first instances of a problem in NP where a poly machine incorrectly `guesses' about the instance. We state and give in full detail a crucial result on the computation of Goedel numbers for some families of poly machines.
dc.descriptionLaTeX
dc.identifierhttps://arxiv.org/abs/math/0106099
dc.identifierhttp://arxiv.org/abs/math/0106099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61642
dc.subjectLogic
dc.titleOn a total function which overtakes all total recursive functions
dc.typetext

Files

Collections

arXiv