Inductive inference and unsolvability

Journal of Symbolic Logic 56 (3):891-900 (1991)
Abstract
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1183743737
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,495
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Learning Via Queries and Oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
29 ( #188,919 of 2,210,648 )

Recent downloads (6 months)
3 ( #154,013 of 2,210,648 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature