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:
“A politician is a statesman who approaches every question with an open mouth.”
—Adlai Stevenson (1900–1965)
“I put forward formless and unresolved notions, as do those who publish doubtful questions to debate in the schools, not to establish the truth but to seek it.”
—Michel de Montaigne (1533–1592)