On a total function which overtakes all total recursive functions
Logic
2007-05-23 v1
Abstract
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 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.
Keywords
Cite
@article{arxiv.math/0106099,
title = {On a total function which overtakes all total recursive functions},
author = {N. C. A. da Costa and F. A. Doria},
journal= {arXiv preprint arXiv:math/0106099},
year = {2007}
}
Comments
LaTeX