Pages that link to "Item:Q676311"
From MaRDI portal
The following pages link to Characterizing language identification in terms of computable numberings (Q676311):
Displaying 10 items.
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Investigations on measure-one identification of classes of languages (Q1271312) (← links)
- Characterizing language identification by standardizing operations (Q1333402) (← links)
- Identifying terminal distinguishable languages (Q1430288) (← links)
- The intrinsic complexity of language identification (Q1924378) (← links)
- Inductive inference and computable numberings (Q2430009) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Learning in Friedberg Numberings (Q3520051) (← links)
- Synthesizing noise-tolerant language learners (Q5941367) (← links)