Computable Variants of AIXI which are More Powerful than AIXItl

Susumu Katayama

doi:10.2478/jagi-2019-0001

.blurhash-client-img { display: none !important; }

Computable Variants of AIXI which are More Powerful than AIXItl

Journal of Artificial General Intelligence

Volume 10 (2019): Issue 1 (January 2019)

By: Susumu Katayama

Open Access

|Apr 2019

Abstract

This paper presents Unlimited Computable AI, or UCAI, that is a family of computable variants of AIXI. UCAI is more powerful than AIXItl, 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 AIXItl only supports Turing machine with timeout ˜t, which can be simulated by typed lambda calculi for any ˜t; 2) unlike UCAI, AIXItl limits the program length to some ˜l .

References

Bird, R., and Wadler, P. 1988. An Introduction to Functional Programming. Prentice-Hall.
Search in Google Scholar Back to article
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–64.
Search in Google Scholar Back to article
Claessen, K., and Pałka, M. H. 2013. Splittable Pseudorandom Number Generators Using Cryptographic Hashing. In Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, Haskell ’13, 47–58. New York, NY, USA: ACM.10.1145/2503778.2503784
Search in Google Scholar Back to article
Hutter, M. 2007. Universal Algorithmic Intelligence: A Mathematical Top→Down Approach. In Goertzel, B., and Pennachin, C., eds., Artificial General Intelligence, Cognitive Technologies. Berlin: Springer. 227–290.10.1007/978-3-540-68677-4_8
Search in Google Scholar Back to article
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–19, 2016, Proceedings, 354–362.10.1007/978-3-319-41649-6_36
Search in Google Scholar Back to article
Plume, D. 1998. A Calculator for Exact Real Number Computation. Ph.D. Dissertation, University of Edinburgh.
Search in Google Scholar Back to article
Sutton, R. S., and Barto, A. G. 1998. Introduction to Reinforcement Learning. Cambridge, MA, USA: MIT Press, 1st edition.
Search in Google Scholar Back to article
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–142.10.1613/jair.3125
Search in Google Scholar Back to article
Watkins, C. J. C. H., and Dayan, P. 1992. Q-learning. In Machine Learning, 279–292.10.1023/A:1022676722315
Search in Google Scholar Back to article
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–664.10.1109/18.382012
Search in Google Scholar Back to article

Articles in this issue

DOI: https://doi.org/10.2478/jagi-2019-0001 | Journal eISSN: 1946-0163

Journal RSS Feed

Language: English

Page range: 1 - 23

Submitted on: Aug 9, 2018

Accepted on: Apr 16, 2019

Published on: Apr 29, 2019

Published by: Artificial General Intelligence Society

In partnership with: Paradigm Publishing Services

Publication frequency: 2 issues per year

Keywords:

AIXI,

artificial general intelligence,

exact real arithmetic,

computability

Related subjects:

Computer sciences,

Artificial intelligence

© 2019 Susumu Katayama, published by Artificial General Intelligence Society
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 10 (2019): Issue 1 (January 2019)