Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kattermann, David, Krapp, Lothar Sebastian
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computational Complexity Logic 8T05, 03D80, 03D25 (Primary) 68Q32, 68T09, 68T27, 68Q04, 03D32 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2511.02644