Open Questions
- If a countable class of recursive languages has a mind change bound for noncomputable learners, does the class also have a mind change bound for computable learners, or is the class unlearnable by a computable learner?
Read more about this topic: Language Identification In The Limit
Famous quotes containing the words open and/or questions:
“The first principle of a free society is an untrammeled flow of words in an open forum.”
—Adlai Stevenson (1900–1965)
“Science asks no questions about the ontological pedigree or a priori character of a theory, but is content to judge it by its performance; and it is thus that a knowledge of nature, having all the certainty which the senses are competent to inspire, has been attained—a knowledge which maintains a strict neutrality toward all philosophical systems and concerns itself not with the genesis or a priori grounds of ideas.”
—Chauncey Wright (1830–1875)