# Computable Variants of AIXI which are More Powerful than AIXItl

arXiv: https://arxiv.org/abs/1805.08592 · HTML: https://mlsanity.com/paper/1805.08592/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 May 2018.

## Built on by (most cited first, 3 of 3)

- [QKSA: Quantum Knowledge Seeking Agent](https://mlsanity.com/paper/2107.01429/) (2021)
- [QKSA: Quantum Knowledge Seeking Agent -- resource-optimized reinforcement learning using quantum process tomography](https://mlsanity.com/paper/2112.03643/) (2021)
- [Approaches to Artificial General Intelligence: An Analysis](https://mlsanity.com/paper/2202.03153/) (2022)

## Abstract (arXiv)

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.