Memory limited inductive inference machines

DOI10.1007/3-540-55706-7_2MaRDI QIDQ5056125zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds, Carl H. Smith

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55706-7_2

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Quantum inductive inference by finite automata
• Learning with Temporary Memory
• Probabilistic inductive inference
• On the power of probabilistic strategies in inductive inference
• Incremental learning with temporary memory

Cites work

• Comparison of identification criteria for machine inductive inference
• Gödel numberings of partial recursive functions
• scientific article; zbMATH DE number 4176473 (Why is no real title available?)
• scientific article; zbMATH DE number 4030991 (Why is no real title available?)
• scientific article; zbMATH DE number 4045211 (Why is no real title available?)
• scientific article; zbMATH DE number 43947 (Why is no real title available?)
• scientific article; zbMATH DE number 50933 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Language identification in the limit
• Learning nested concept classes with limited storage
• On notation for ordinal numbers
• Probabilistic inductive inference
• Probability and plurality for aggregations of learning machines
• Toward a mathematical theory of inductive inference

Cited in

(17)

• Learning with the knowledge of an upper bound on program size
• Maximal machine learnable classes
• Experience, generations, and limits in machine learning
• Learning in the limit: a mutational and adaptive approach
• scientific article; zbMATH DE number 446846 (Why is no real title available?)
• On the influence of technology on learning processes
• On the inference of sequences of functions
• ON LEARNING LIMITING PROGRAMS
• On the impact of forgetting on learning machines
• Learning with confidence
• Learning nested concept classes with limited storage
• Learning with Finite Memory
• Application of kolmogorov complexity to inductive inference with limited memory
• Resource restricted computability theoretic learning: Illustrative topics and problems
• On the power of probabilistic strategies in inductive inference
• Training sequences
• Quantum inductive inference by finite automata

This page was built for publication: Memory limited inductive inference machines

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