This paper presents Unlimited Computable AI, or UCAI, that is a family of computable variants of AIXI. UCAI is more powerful than AIXItl, that is a conventional family of computable variants of AIXI, in the following ways: 1) UCAI supports models of terminating computation, including typed lambda calculus, while AIXItl only supports Turing machine with timeout t, which can be simulated by typed lambda calculus for any t; 2) unlike UCAI, AIXItl limits the program length to l.
@article{arxiv.1805.08592,
title = {Computable Variants of AIXI which are More Powerful than AIXItl},
author = {Susumu Katayama},
journal= {arXiv preprint arXiv:1805.08592},
year = {2019}
}