{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T11:59:42Z","timestamp":1769774382707,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032159861","type":"print"},{"value":"9783032159878","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15987-8_7","type":"book-chapter","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:27:24Z","timestamp":1769718444000},"page":"97-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on\u00a0Learning Algorithms as\u00a0Approximations of\u00a0Solomonoff Induction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6720-8875","authenticated-orcid":false,"given":"Cleyton","family":"Slaviero","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4999-7476","authenticated-orcid":false,"given":"Edward Hermann","family":"Haeusler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,30]]},"reference":[{"key":"7_CR1","unstructured":"Banafa, A.: Large language models as data compression engines (2023). Online article, DOI unavailable"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1162\/153244303322533223","volume":"3","author":"Y Bengio","year":"2003","unstructured":"Bengio, Y., Ducharme, R., Vincent, P., Jauvin, C.: A neural probabilistic language model. J. Mach. Learn. Res. 3, 1137\u20131155 (2003). https:\/\/doi.org\/10.1162\/153244303322533223","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR3","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463\u2013482 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Grau-Moya, J., et al.: Learning universal predictors. arXiv preprint arXiv:2401.14953 (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.14953","DOI":"10.48550\/arXiv.2401.14953"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Grunwald, P.D.: The Minimum Description Length Principle. MIT Press (2007). https:\/\/doi.org\/10.7551\/mitpress\/4643.001.0001","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Gilbert, H., Sandborn, M., Schmidt, D.C., Spencer-Smith, J., White, J.: Semantic compression with large language models (2023). https:\/\/doi.org\/10.48550\/arXiv.2304.12512","DOI":"10.48550\/arXiv.2304.12512"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Hutter, M.: Towards a universal theory of artificial intelligence based on algorithmic probability and sequential decision theory. arXiv preprint cs\/0004001 (2001). https:\/\/doi.org\/10.48550\/arXiv.cs\/0012011","DOI":"10.48550\/arXiv.cs\/0012011"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer (2005). https:\/\/doi.org\/10.1007\/b138233","DOI":"10.1007\/b138233"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Kaplan, J., et al.: Scaling laws for neural language models. arXiv preprint arXiv:2001.08361 (2020). https:\/\/doi.org\/10.48550\/arXiv.2001.08361","DOI":"10.48550\/arXiv.2001.08361"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Li , M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science. Springer, 4 edn. (2019). https:\/\/doi.org\/10.1007\/978-3-030-11298-1","DOI":"10.1007\/978-3-030-11298-1"},{"issue":"5","key":"7_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978). https:\/\/doi.org\/10.1016\/0005-1098(78)90005-5","journal-title":"Automatica"},{"key":"7_CR12","unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I.: Language models are unsupervised multitask learners (2019). OpenAI Technical Report, DOI unavailable"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7(1\u20132), 1\u201322","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. part i and part ii. Inf. Control 7(1\u20132), 1\u201322, 224\u2013254 (1964). https:\/\/doi.org\/10.1016\/S0019-9958(64)90223-2","journal-title":"Inf. Control"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press (2014). ISBN: 9781107057135. https:\/\/doi.org\/10.1017\/CBO9781107298019","DOI":"10.1017\/CBO9781107298019"},{"issue":"96","key":"7_CR15","first-page":"345","volume":"24","author":"WM Thorburn","year":"1915","unstructured":"Thorburn, W.M.: The myth of occam\u2019s razor. Mind 24(96), 345\u2013353 (1915)","journal-title":"Mind"},{"key":"7_CR16","unstructured":"Vapnik, V.N.: Statistical Learning Theory. Wiley (1998). ISBN: 9780471030034"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol.\u00a030 (2017). https:\/\/doi.org\/10.5555\/3295222.3295349","DOI":"10.5555\/3295222.3295349"},{"key":"7_CR18","unstructured":"Xi, D., Zhuang, D.: Model selection of sequence prediction algorithms by compression. In: Proceedings of the Sequence Prediction Challenge (SPiCe). JMLR Workshop and Conference Proceedings, vol. 57, pp. 160\u2013163 (2016)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15987-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:27:26Z","timestamp":1769718446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15987-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032159861","9783032159878"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15987-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"30 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fortaleza-CE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bracis.sbc.org.br\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}