On a total function which overtakes all total recursive functions

Preprint English OPEN
da Costa, N. C. A.; Doria, F. A.;
  • Subject: Mathematics - Logic

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 i... View more
  • References (15)
    15 references, page 1 of 2

    [1] F. Cucker, e-mail messages to the authors (1998).

    [2] N. C. A. da Costa, F. A. Doria and A. F. Furtado-do-Amaral, “A dynamical system where proving chaos is equivalent to proving Fermat's conjecture,” Int. J. Theoret. Physics, 32, 2187-2206 (1993).

    [3] F. A. Doria, M. Ribeiro da Silva and A. F. Furtado do Amaral, “A generalization of Einstein's λ-transformation and gravitational copies,” Lett. Nuovo Cimento 40, 509 (1984).

    [4] F. A. Doria, S. M. Abrah˜ao and A. F. Furtado do Amaral, “A Dirac-like equation for gauge fields,” Progr. Theoretical Physics 75, 1440 (1986).

    [5] F. A. Doria, “Is there a simple, pedestrian, arithmetic sentence which is independent of ZFC?” Synth`ese 125, # 1/2, 69 (2000).

    [6] A. Einstein, The Meaning of Relativity, Methuen (1967).

    [7] H. M. Friedman, “Finite functions and the necessary use of large cardinals,” Ann. Math. 148, 803 (1998).

    [8] H. Hermes, Enumerability, Decidability, Computability, Springer (1965).

    [9] J. E. Hopcroft and J. D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley (1969).

    [10] S. C. Kleene, Mathematical Logic, John Wiley (1967).

  • Related Organizations (2)
  • Metrics
Share - Bookmark