Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems

DOI10.1007/978-3-540-73001-9_12MaRDI QIDQ5426871zbMATH OpenOpenAlexFDO

Authors John Case

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_12

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Resource restricted computability theoretic learning: Illustrative topics and problems
• Computability-theoretic learning complexity
• Resource-bounded measure and learnability
• Complexity theoretic limitations on learning halfspaces
• scientific article; zbMATH DE number 1335899
• On the Complexity of Learning Minimum Time-Bounded Turing Machines
• Learning and computing in the limit
• Remarks on computational learning theory
• scientific article; zbMATH DE number 8767
• scientific article; zbMATH DE number 53984

Cited in

(3)

• scientific article; zbMATH DE number 5899249 (Why is no real title available?)
• On the Complexity of Learning Minimum Time-Bounded Turing Machines
• Resource restricted computability theoretic learning: Illustrative topics and problems

This page was built for publication: Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems

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