Asking Questions versus Verifiability

Asking Questions versus Verifiability (1992)

Cached

Download Links

[www.cs.umd.edu]

Other Repositories/Bibliography

DBLP

by William Gasarch , Mahendran Velauthapillai

Citations:

10 - 4 self

BibTeX

@MISC{Gasarch92askingquestions,
    author = {William Gasarch and Mahendran Velauthapillai},
    title = {Asking Questions versus Verifiability},
    year = {1992}
}

Bookmark

OpenURL

Abstract

this paper, # 0 , # 1 , # 2 , . . . denotes an acceptable programming system [17], also known as a Godel numbering of the partial recursive functions [15]. The function # e is said to be computed by the program e.

Citations

793	Language identification in the limit - Gold - 1967
411	Recursively Enumerable Sets and Degrees - Soare - 1987
286	Inductive inference: Theory and methods - ANGLUIN, SMITH - 1983
250	Towards a Mathematical Theory of Inductive Inference - Blum, Blum - 1975
161	Comparison of Identification Criteria for Machine Inductive Inference. Theoret - Case, Smith - 1983
81	Theory of Recursive Functions and Eective Computability McGraw-Hill Pub - Rogers - 1967
56	The power of pluralism for automatic program synthesis - Smith - 1982
38	The decision problem for exponential Diophantine equations - Davies, Putnam, et al. - 1961
35	Learning via queries - Gasarch, Smith - 1991
8	Learning via queries, teams, and anomalies - Gasarch, Kinber, et al. - 1995
5	Recursion theoretic models of learning: some results and intuitions - Gasarch, Smith - 1995
5	The strength of noninclusions for teams of finite learners - Kummer - 1994
4	Enumerable sets are diophantine (Russian). Doklady Academy Nauk - Matijasevic - 1970
2	Automata techniques for query inference machines. Annals of pure and applied logic - Gasarch, Hird - 1995
1	A survey of inductive inference with an emphasis on learning via queries - Gasarch, Smith - 1997