Pages that link to "Item:Q1151889"
From MaRDI portal
The following pages link to Research in the theory of inductive inference by GDR mathematicians - A survey (Q1151889):
Displaying 22 items.
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- Polynomial-time inference of arbitrary pattern languages (Q749229) (← links)
- On the power of probabilistic strategies in inductive inference (Q760795) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- On the power of recursive optimizers (Q1114401) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- On the power of inductive inference from good examples (Q1210543) (← links)
- Program size restrictions in computational learning (Q1342242) (← links)
- Learning in the presence of inaccurate information (Q1351959) (← links)
- On the intrinsic complexity of learning recursive functions (Q1398370) (← links)
- Learning how to separate. (Q1426149) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Learning classes of approximations to non-recursive functions. (Q1853518) (← links)
- Robust behaviorally correct learning. (Q1854310) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- On learning of functions refutably. (Q1874231) (← links)
- Robust learning -- rich and poor (Q1880777) (← links)
- Absolutely no free lunches! (Q2207503) (← links)
