Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-05-25T19:59:47.581Z Has data issue: false hasContentIssue false
  • English
  • Français

Inductive inference and unsolvability

Published online by Cambridge University Press:  12 March 2014

Leonard M. Adleman  and
M. Blum
Leonard M. Adleman
Affiliation:
Department of Computer Science, University of Southern California, Los Angeles, California 90089-0782
M. Blum
Affiliation:
Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California, Berekeley, California 94720
Get access Rights & Permissions [Opens in a new window]

Abtract

It is shown that many different problems have the same degree of unsolvability. Among these problems are:

The Inductive Inference Problem. Infer in the limit an index for a recursive function f presented as f(0), f(1),f(2),….

The Recursive Index Problem. Decide in the limit if i is the index of a total recursive function.

The Zero Nonvariant Problem. Decide in the limit if a recursive function f presented as f(0), f(1), f(2),… has value unequal to zero for infinitely many arguments.

Finally, it is shown that these unsolvable problems are strictly easier than the halting problem.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 56 , Issue 3 , September 1991 , pp. 891 - 900
Copyright
Copyright © Association for Symbolic Logic 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[AS] Angluin, D. and Smith, C., Inductive inference: theory and methods, Computing Surveys, vol. 15 (1983), pp. 237–269.CrossRefGoogle Scholar
[Bl] Blum, M., A machine independent theory of the complexity of recursive functions, Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336.CrossRefGoogle Scholar
[B12] Blum, L. and Blum, M., Toward a mathematical theory of inductive inference, Information and Control, vol. 28 (1975), pp. 125–155.CrossRefGoogle Scholar
[Br] Brandt, U., The position of index sets of identifiable sets in the arithmetical hierarchy, Information and Control, vol. 68 (1986), pp. 185–195.CrossRefGoogle Scholar
[Go] Gold, E. M., Limiting recursion, this Journal, vol. 30 (1965), pp. 28–48.Google Scholar
[Go2] Gold, E. M., Language identification in the limit, Information and Control, vol. 10 (1967), pp. 447–474.CrossRefGoogle Scholar
[GP] Gasarch, W. I. and Pleszkoch, M. B., Learning via queries to an oracle, Conference on computational learning (Santa Cruz, 1989) (to appear).Google Scholar
[Po] Popper, K. R., The logic of scientific discovery, 2nd ed., Harper & Row, New York, 1968.Google Scholar
[Ro] Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[Sa] Sacks, G., Degrees of unsolvability, Princeton University Press, Princeton, New Jersey, 1963.Google Scholar
[Sh] Shoenfield, J. R., Degrees of unsolvability, North-Holland, Amsterdam, 1971.Google Scholar