Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
type: Item
instance of: scholarly article
title: Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
zbMATH Open document ID: 1151.68436
DOI: 10.1007/978-3-540-73001-9_12
published in: Lecture Notes in Computer Science
publication date: 2007-11-13T00:00:00Z
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5211240
author: John Case
MaRDI profile type: Publication
full work available at URL: 978-3-540-73001-9 12
OpenAlex ID: W1479932274
Recommended article: Resource restricted computability theoretic learning: Illustrative topics and problems
Recommended article: Computability-theoretic learning complexity
Recommended article: Resource-bounded measure and learnability
Recommended article: Complexity theoretic limitations on learning halfspaces
Recommended article: Q4258590
Recommended article: On the Complexity of Learning Minimum Time-Bounded Turing Machines
Recommended article: Q5494240
Recommended article: Remarks on computational learning theory
Recommended article: Q3971255
Recommended article: Q4004178
description: scientific article; zbMATH DE number 5211240