Computable Variants of AIXI which are More Powerful than AIXI tl

Abstract

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