Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
From MaRDI portal
Publication:5426871
DOI10.1007/978-3-540-73001-9_12zbMATH Open1151.68436OpenAlexW1479932274MaRDI QIDQ5426871
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
Related Items (2)
Title not available (Why is that?) ⋮ On the Complexity of Learning Minimum Time-Bounded Turing Machines
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Resource restricted computability theoretic learning: Illustrative topics and problems 👍 👎
- Remarks on computational learning theory 👍 👎
- Resource-bounded measure and learnability 👍 👎
- Computability-theoretic learning complexity 👍 👎
- On the Complexity of Learning Minimum Time-Bounded Turing Machines 👍 👎
- Complexity theoretic limitations on learning halfspaces 👍 👎
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)
