Pages that link to "Item:Q673668"
From MaRDI portal
The following pages link to A learning-theoretic characterization of classes of recursive functions (Q673668):
Displaying 15 items.
- Enlarging learnable classes (Q342717) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Learning-theoretic perspectives of acceptable numberings (Q1380421) (← links)
- On the intrinsic complexity of learning recursive functions (Q1398370) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Learning classes of approximations to non-recursive functions. (Q1853518) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- Recursion theoretic models of learning: Some results and intuitions (Q1924732) (← links)
- Inductive inference and computable numberings (Q2430009) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Some independence results for control structures in complete numberings (Q2732286) (← links)
- Confident and Consistent Partial Learning of Recursive Functions (Q3164810) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)
- Co-learning of recursive languages from positive data (Q6570930) (← links)
