The Power of Pluralism for Automatic Program Synthesis
From MaRDI portal
Publication:3960153
DOI10.1145/322344.322356zbMath0496.68065OpenAlexW2017636732MaRDI QIDQ3960153
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322344.322356
Related Items
Counting extensional differences in BC-learning ⋮ Parallel learning of automatic classes of languages ⋮ Probability and plurality for aggregations of learning machines ⋮ Inductive inference of recursive functions: Qualitative theory ⋮ Infinitary self-reference in learning theory ⋮ The power of probabilism in Popperian FINite learning ⋮ On aggregating teams of learning machines ⋮ Learning recursive functions from approximations ⋮ Learning via queries in [+, <] ⋮ Recursion theoretic models of learning: Some results and intuitions ⋮ On the relative sizes of learnable sets ⋮ Probabilistic and pluralistic learners with mind changes ⋮ Probabilistic language learning under monotonicity constraints ⋮ Simulating teams with many conjectures ⋮ Learning recursive functions: A survey ⋮ Absolute versus probabilistic classification in a logical setting ⋮ Non-U-shaped vacillatory and team learning ⋮ Inferring answers to queries ⋮ Taming teams with mind changes ⋮ Learning in the presence of partial explanations ⋮ Aggregating inductive expertise on partial recursive functions ⋮ Iterative learning from positive data and negative counterexamples ⋮ Measure, category and learning theory ⋮ Learning languages from positive data and a finite number of queries ⋮ Hierarchies of probabilistic and team FIN-learning ⋮ Probabilistic inductive inference: A survey ⋮ Robust learning is rich ⋮ Comparison of identification criteria for machine inductive inference ⋮ Closedness properties in ex-identification ⋮ Unnamed Item ⋮ On the amount of nonconstructivity in learning formal languages from text ⋮ On the power of probabilistic strategies in inductive inference ⋮ Trade-off among parameters affecting inductive inference ⋮ Learning from Streams ⋮ Automata techniques for query inference machines ⋮ Learning to win process-control games watching game-masters ⋮ Learning by the process of elimination ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ On the inference of approximate programs ⋮ Avoiding coding tricks by hyperrobust learning ⋮ Extremes in the degrees of inferability ⋮ Training sequences ⋮ Learning via finitely many queries
