Pages that link to "Item:Q1244823"
From MaRDI portal
The following pages link to Some natural properties of strong-identification in inductive inference (Q1244823):
Displaying 40 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Enlarging learnable classes (Q342717) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- Training sequences (Q811136) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Reflective inductive inference of recursive functions (Q924166) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
- On some open problems in reflective inductive inference (Q976076) (← links)
- Semantic analysis of inductive reasoning (Q1081317) (← links)
- Saving the phenomena: Requirements that inductive inference machines not contradict known data (Q1115637) (← links)
- Research in the theory of inductive inference by GDR mathematicians - A survey (Q1151889) (← links)
- Aggregating inductive expertise on partial recursive functions (Q1187022) (← links)
- Learning with refutation (Q1278041) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- Learning how to separate. (Q1426149) (← links)
- Avoiding coding tricks by hyperrobust learning (Q1603596) (← links)
- Learning classes of approximations to non-recursive functions. (Q1853518) (← links)
- On learning of functions refutably. (Q1874231) (← links)
- Refuting learning revisited. (Q1874232) (← links)
- Trees and learning (Q1878683) (← links)
- Robust learning -- rich and poor (Q1880777) (← links)
- Learning secrets interactively. Dynamic modeling in inductive inference (Q1932174) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings (Q2106597) (← links)
- Learning Families of Closed Sets in Matroids (Q2891307) (← links)
- Dynamically Delayed Postdictive Completeness and Consistency in Learning (Q3529936) (← links)
- Dynamic Modeling in Inductive Inference (Q3529937) (← links)
- (Q3704795) (← links)
- (Q4300060) (← links)
- Generalization versus classification (Q4835848) (← links)
- On the classification of computable languages (Q5048927) (← links)
- MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY (Q5248981) (← links)
- Robust learning with infinite additional information (Q5941287) (← links)
- Costs of general purpose learning (Q5941288) (← links)
- Probabilistic inductive inference: A survey (Q5941566) (← links)
- Partial learning of recursively enumerable languages (Q5964064) (← links)
