Pages that link to "Item:Q1317427"
From MaRDI portal
The following pages link to On the role of procrastination in machine learning (Q1317427):
Displaying 39 items.
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Unifying logic, topology and learning in parametric logic (Q817837) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Probabilistic and team PFIN-type learning: General properties (Q927866) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- Topological properties of concept spaces (full version) (Q963060) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- The logic of reliable and efficient inquiry (Q1303795) (← links)
- On the intrinsic complexity of learning recursive functions (Q1398370) (← links)
- Learning by switching type of information. (Q1427864) (← links)
- Uncomputability: The problem of induction internalized (Q1434378) (← links)
- Robust learning aided by context (Q1567396) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- Mind change complexity of learning logic programs (Q1603595) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- Generalized notions of mind change complexity (Q1881221) (← links)
- Counting extensional differences in BC-learning (Q1887167) (← links)
- Recursion theoretic models of learning: Some results and intuitions (Q1924732) (← links)
- Calculating the mind change complexity of learning algebraic structures (Q2104247) (← links)
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data (Q2268856) (← links)
- On the data consumption benefits of accepting increased uncertainty (Q2381574) (← links)
- Ockham's razor, empirical complexity, and truth-finding efficiency (Q2383597) (← links)
- Mind change efficient learning (Q2496299) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Borel-Piecewise Continuous Reducibility for Uniformization Problems (Q2974788) (← links)
- Rice and Rice-Shapiro Theorems for transfinite correction grammars (Q3096086) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- Feasible Iteration of Feasible Learning Functionals (Q3520048) (← links)
- Topological Properties of Concept Spaces (Q3529935) (← links)
- Dynamically Delayed Postdictive Completeness and Consistency in Learning (Q3529936) (← links)
- Learning correction grammars (Q3630576) (← links)
- Incremental Learning with Ordinal Bounded Example Memory (Q3648761) (← links)
- Parsimony hierarchies for inductive inference (Q5311725) (← links)
- Learning algebraic structures from text (Q5958647) (← links)
