Abstract
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.
The research by the first author was supported by Latvian Science Council Grant No.93.599
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Blum, M. (1967), A machine independent theory of the complexity of recursive functions. Journal of the Association of Computing Machinery 14, 322–336
Freivalds, R. (1978), Effective operations and functional computable in the limit. Zeitschrift Math. Logik und Grundlagen der Math. 24, 193–206 (in Russian)
Freivalds, R. (1991), Inductive inference of recursive functions:qualitative theory. Lecture Notes in Computer Science 502, 77–110
Freivald, R.V.(Freivalds, R.) and Wiehagen, R. (1979), Inductive inference with additional information. Journal of Information Processing and Cybernetics 15, 179–185
Gold, E.M. (1965), Limiting recursion. Journal of Symbolic Logic 30, 28–48
Kolmogorov, A.N. (1965), Three approaches to the quantitative definition of information. Problems Information Transmission 1, 1–7 (translated from Russian)
Rogers, H. Jr. (1987), Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, Massachusetts
Schnorr, C.P. (1974), Optimal enumerations and optimal Gödel numberings. Mathematical Systems Theory 8, 182–191
Wiehagen, R. (1976), Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Journal of Information Processing and Cybernetics 12, 93–99
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freivalds, R., Botuscharov, O., Wiehagen, R. (1994). Identifying nearly minimal Gödel numbers from additional information. In: Arikawa, S., Jantke, K.P. (eds) Algorithmic Learning Theory. AII ALT 1994 1994. Lecture Notes in Computer Science, vol 872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58520-6_56
Download citation
DOI: https://doi.org/10.1007/3-540-58520-6_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58520-6
Online ISBN: 978-3-540-49030-2
eBook Packages: Springer Book Archive