On a total function which overtakes all total recursive functions

Details On a total function which overtakes all total recursive functions On a total function which overtakes all total recursive functions

2001-06-12

arxiv.org/abs/math/0106099v1

Mathematics

Logic

LaTeX

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On a total function which overtakes all total recursive functions 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 On a total function which overtakes all total recursive functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a total function which overtakes all total recursive functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147849