{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T20:59:18Z","timestamp":1777582758029,"version":"3.51.4"},"reference-count":10,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This paper presents Unlimited Computable AI, or UCAI, that is a family of computable variants of AIXI. UCAI is more powerful than AIXI\n                    <jats:italic>tl<\/jats:italic>\n                    , which is a conventional family of computable variants of AIXI, in the following ways: 1) UCAI supports models of terminating computation, including typed lambda calculi, while AIXI\n                    <jats:italic>tl<\/jats:italic>\n                    only supports Turing machine with timeout \u02dc\n                    <jats:italic>t<\/jats:italic>\n                    , which can be simulated by typed lambda calculi for any \u02dc\n                    <jats:italic>t<\/jats:italic>\n                    ; 2) unlike UCAI, AIXI\n                    <jats:italic>tl<\/jats:italic>\n                    limits the program length to some \u02dc\n                    <jats:italic>l<\/jats:italic>\n                    .\n                  <\/jats:p>","DOI":"10.2478\/jagi-2019-0001","type":"journal-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T07:49:10Z","timestamp":1556610550000},"page":"1-23","source":"Crossref","is-referenced-by-count":1,"title":["Computable Variants of AIXI which are More Powerful than AIXI\n                    <i>tl<\/i>"],"prefix":"10.2478","volume":"10","author":[{"given":"Susumu","family":"Katayama","sequence":"first","affiliation":[{"name":"University of Miyazaki 1-1 Gakuenkibanadainishi Miyazaki, Miyazaki 889-2192 , Japan"}]}],"member":"374","published-online":{"date-parts":[[2019,4,29]]},"reference":[{"key":"2026042814145910395_j_jagi-2019-0001_ref_001_w2aab3b7b1b1b6b1ab1ab1Aa","unstructured":"Bird, R., and Wadler, P. 1988. An Introduction to Functional Programming. Prentice-Hall."},{"key":"2026042814145910395_j_jagi-2019-0001_ref_002_w2aab3b7b1b1b6b1ab1ab2Aa","unstructured":"Boehm, H., and Cartwright, R. 1990. Exact Real Arithmetic Formulating Real Numbers As Functions. In Turner, D. A., ed., Research Topics in Functional Programming. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc. 43\u201364."},{"key":"2026042814145910395_j_jagi-2019-0001_ref_003_w2aab3b7b1b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"Claessen, K., and Pa\u0142ka, M. H. 2013. Splittable Pseudorandom Number Generators Using Cryptographic Hashing. In Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, Haskell \u201913, 47\u201358. New York, NY, USA: ACM.10.1145\/2503778.2503784","DOI":"10.1145\/2503778.2503784"},{"key":"2026042814145910395_j_jagi-2019-0001_ref_004_w2aab3b7b1b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"Hutter, M. 2007. Universal Algorithmic Intelligence: A Mathematical Top\u2192Down Approach. In Goertzel, B., and Pennachin, C., eds., Artificial General Intelligence, Cognitive Technologies. Berlin: Springer. 227\u2013290.10.1007\/978-3-540-68677-4_8","DOI":"10.1007\/978-3-540-68677-4_8"},{"key":"2026042814145910395_j_jagi-2019-0001_ref_005_w2aab3b7b1b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"Katayama, S. 2016. Ideas for a Reinforcement Learning Algorithm that Learns Programs. In Artificial General Intelligence - 9th International Conference, AGI 2016, AGI 2016, New York, USA, July 16\u201319, 2016, Proceedings, 354\u2013362.10.1007\/978-3-319-41649-6_36","DOI":"10.1007\/978-3-319-41649-6_36"},{"key":"2026042814145910395_j_jagi-2019-0001_ref_006_w2aab3b7b1b1b6b1ab1ab6Aa","unstructured":"Plume, D. 1998. A Calculator for Exact Real Number Computation. Ph.D. Dissertation, University of Edinburgh."},{"key":"2026042814145910395_j_jagi-2019-0001_ref_007_w2aab3b7b1b1b6b1ab1ab7Aa","unstructured":"Sutton, R. S., and Barto, A. G. 1998. Introduction to Reinforcement Learning. Cambridge, MA, USA: MIT Press, 1st edition."},{"key":"2026042814145910395_j_jagi-2019-0001_ref_008_w2aab3b7b1b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"Veness, J.; Ng, K. S.; Hutter, M.; Uther, W.; and Silver, D. 2011. A Monte-Carlo AIXI Approximation. Journal of Artificial Intelligence Research 40:95\u2013142.10.1613\/jair.3125","DOI":"10.1613\/jair.3125"},{"key":"2026042814145910395_j_jagi-2019-0001_ref_009_w2aab3b7b1b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"Watkins, C. J. C. H., and Dayan, P. 1992. Q-learning. In Machine Learning, 279\u2013292.10.1023\/A:1022676722315","DOI":"10.1023\/A:1022676722315"},{"key":"2026042814145910395_j_jagi-2019-0001_ref_010_w2aab3b7b1b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"Willems, F. M. J.; Shtarkov, Y. M.; and Tjalkens, T. J. 1995. The Context Tree Weighting Method: Basic Properties. IEEE Transactions on Information Theory 41:653\u2013664.10.1109\/18.382012","DOI":"10.1109\/18.382012"}],"container-title":["Journal of Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/content.sciendo.com\/view\/journals\/jagi\/10\/1\/article-p1.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/reference-global.com\/pdf\/10.2478\/jagi-2019-0001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T19:49:32Z","timestamp":1777405772000},"score":1,"resource":{"primary":{"URL":"https:\/\/reference-global.com\/article\/10.2478\/jagi-2019-0001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":10,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,4,29]]},"published-print":{"date-parts":[[2019,1,1]]}},"alternative-id":["10.2478\/jagi-2019-0001"],"URL":"https:\/\/doi.org\/10.2478\/jagi-2019-0001","relation":{},"ISSN":["1946-0163"],"issn-type":[{"value":"1946-0163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}