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:
“What is not in the open street is false, derived, that is to say, literature.”
—Henry Miller (1891–1980)
“It is not impossible, of course, after such an administration as Roosevelt’s and after the change in method that I could not but adapt in view of my different way of looking at things, that questions should arise as to whether I should go back on the principles of the Roosevelt administration.... I have a government of limited power under a Constitution, and we have got to work out our problems on the basis of law. Now, if that is reactionary, then I am a reactionary.”
—William Howard Taft (1857–1930)