Recursion theoretic models of learning: Some results and intuitions

DOI10.1007/BF01534453zbMATH Open0855.68078OpenAlexW1968197408MaRDI QIDQ1924732FDOQ1924732

Carl H. Smith, William Gasarch

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01534453

zbMATH Keywords

learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Prudence and other conditions on formal language learning
• The constructive second number class
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Training sequences
• Comparison of identification criteria for machine inductive inference
• On the role of procrastination in machine learning
• Probability and plurality for aggregations of learning machines
• Learning via queries in [+, <]
• Learning via queries
• Aggregating inductive expertise

Cited In (4)

• Parsimony hierarchies for inductive inference
• Infinitary self-reference in learning theory
• On the intrinsic complexity of learning recursive functions
• Learning via finitely many queries

This page was built for publication: Recursion theoretic models of learning: Some results and intuitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924732)