Computable Variants of AIXI which are More Powerful than AIXItl

TL;DR

This paper introduces UCAI, a new family of computable AI models that surpass AIXItl by supporting richer computational models like typed lambda calculus and removing program length restrictions.

Contribution

The paper proposes UCAI, a more powerful computable variant of AIXI, capable of modeling terminating computations and removing program length limits.

Findings

UCAI supports typed lambda calculus models.

UCAI is more powerful than AIXItl.

UCAI removes program length restrictions.

Abstract

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.