tag:blogger.com,1999:blog-8540876.post115960817430299787..comments2023-02-20T13:29:13.039+03:00Comments on Deniz Yuret's Homepage: Mathematics of GeneralizationDeniz Yurethttp://www.blogger.com/profile/00578023665603100985noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-8540876.post-1159608485842034722006-09-30T12:28:00.000+03:002006-09-30T12:28:00.000+03:00A learning problem is described as figuring out a ...A learning problem is described as figuring out a mapping between from a set X to a set Y. The interesting observation is even if the set X is non-countable, the mappings induced by any learning algorithm (being programs) are countable. So the learning algorithm cannot access the uncountable infinity of the input space and we don't lose anything by restricting ourselves to a discussion of countable spaces.Deniz Yurethttps://www.blogger.com/profile/00578023665603100985noreply@blogger.com