Measure, category and learning theory

DOI10.1007/3-540-60084-1_105zbMATH Open1412.68093OpenAlexW1545761782MaRDI QIDQ4645211FDOQ4645211

Authors: Stuart A. Kurtz, Lance Fortnow, Rūsiņš Freivalds, William Gasarch, Martin Kummer, Carl H. Smith, Frank Stephan 

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_105

Recommendations

• On the relative sizes of learnable sets
• scientific article; zbMATH DE number 2086243
• Effective Baire category concepts
• Computability of measurable sets via effective topologies
• Effective category and measure in abstract complexity theory

zbMATH Keywords

inductive inferenceinitial segmentrecursive treerecursive functionteam learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Theory of numerations, effectively presented structures (03D45) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• Almost everywhere high nonuniform complexity
• Title not available (Why is that?)
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Comparison of identification criteria for machine inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability and plurality for aggregations of learning machines
• Breaking the probability \({1\over 2}\) barrier in FIN-type learning
• Title not available (Why is that?)
• Aggregating inductive expertise
• THE BANACH-MAZUR GAME

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Measure, category and learning theory

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