Identifying nearly minimal Gödel numbers from additional information

  • Rūsiņš Freivalds
  • Ognian Botuscharov
  • Rolf Wiehagen
Selected Papers Analogical and Inductive Inference
Part of the Lecture Notes in Computer Science book series (LNCS, volume 872)


A new identification type close to the identification of minimal Gödel numbers is considered. The type is defined by allowing as input both the graph of the target function and an arbitrary upper bound of the minimal index of the target function in a Gödel numbering of all partial recursive functions. However, the result of the inference has to be bounded by a fixed function from the given bound. Results characterizing the dependence of this identification type from the underlying Gödel numbering are obtained. In particular, it is shown that for a wide class of Gödel numberings, the class of all recursive functions can be identified even for “small” bounding functions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Blum, M. (1967), A machine independent theory of the complexity of recursive functions. Journal of the Association of Computing Machinery 14, 322–336Google Scholar
  2. Freivalds, R. (1978), Effective operations and functional computable in the limit. Zeitschrift Math. Logik und Grundlagen der Math. 24, 193–206 (in Russian)Google Scholar
  3. Freivalds, R. (1991), Inductive inference of recursive functions:qualitative theory. Lecture Notes in Computer Science 502, 77–110Google Scholar
  4. Freivald, R.V.(Freivalds, R.) and Wiehagen, R. (1979), Inductive inference with additional information. Journal of Information Processing and Cybernetics 15, 179–185Google Scholar
  5. Gold, E.M. (1965), Limiting recursion. Journal of Symbolic Logic 30, 28–48Google Scholar
  6. Kolmogorov, A.N. (1965), Three approaches to the quantitative definition of information. Problems Information Transmission 1, 1–7 (translated from Russian)Google Scholar
  7. Rogers, H. Jr. (1987), Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MassachusettsGoogle Scholar
  8. Schnorr, C.P. (1974), Optimal enumerations and optimal Gödel numberings. Mathematical Systems Theory 8, 182–191Google Scholar
  9. Wiehagen, R. (1976), Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Journal of Information Processing and Cybernetics 12, 93–99Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Rūsiņš Freivalds
    • 1
  • Ognian Botuscharov
    • 2
  • Rolf Wiehagen
    • 3
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia
  2. 2.Department of Computer ScienceUniversity of SofiaSofiaBulgaria
  3. 3.Department of Computer ScienceUniversity of KaiserslauternKaiserslauternGermany

Personalised recommendations