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:
“All deep, earnest thinking is but the intrepid effort of the soul to keep the open independence of her sea; while the wildest winds of heaven and earth conspire to cast her on the treacherous, slavish shore.”
—Herman Melville (1819–1891)
“The grand Perhaps! We look on helplessly,
There the old misgivings, crooked questions are.”
—Robert Browning (1812–1889)