Pages that link to "Item:Q4154852"
From MaRDI portal
The following pages link to Toward a mathematical theory of inductive inference (Q4154852):
Displaying 50 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- A map of update constraints in inductive inference (Q329603) (← links)
- Parallel learning of automatic classes of languages (Q329605) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Enlarging learnable classes (Q342717) (← links)
- Learning and classifying (Q390916) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- Confident and consistent partial learning of recursive functions (Q465247) (← links)
- Unscrambling the quantum omelette (Q472735) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Optimal language learning from positive data (Q642522) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- On a question about learning nearly minimal programs (Q674285) (← links)
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- Polynomial-time inference of arbitrary pattern languages (Q749229) (← links)
- On the power of probabilistic strategies in inductive inference (Q760795) (← links)
- Note on a central lemma for learning theory (Q794446) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- On the inference of approximate programs (Q803121) (← links)
- Training sequences (Q811136) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Learning languages in a union (Q859985) (← links)
- An approach to intrinsic complexity of uniform learning (Q860823) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Prudence and other conditions on formal language learning (Q912648) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Reflective inductive inference of recursive functions (Q924166) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- Absolute versus probabilistic classification in a logical setting (Q924172) (← links)
- Some classes of term rewriting systems inferable from positive data (Q924174) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- Inferring answers to queries (Q927868) (← links)
- Taming teams with mind changes (Q927869) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
