On a total function which overtakes all total recursive functions
N. C. A. da Costa, F. A. Doria
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.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski