Computable Variants of AIXI which are More Powerful than AIXItl

05/22/2018
by   Susumu Katayama, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2019

On the incomputability of computable dimension

Using an iterative tree construction we show that for simple computable ...
research
10/13/2011

Are Minds Computable?

This essay explores the limits of Turing machines concerning the modelin...
research
02/05/2018

A Galois connection between Turing jumps and limits

Limit computable functions can be characterized by Turing jumps on the i...
research
12/22/2020

Computable Random Variables and Conditioning

The aim of this paper is to present an elementary computable theory of r...
research
06/13/2022

A Dilemma for Solomonoff Prediction

The framework of Solomonoff prediction assigns prior probability to hypo...
research
04/08/2019

Learning the undecidable from networked systems

This article presents a theoretical investigation of computation beyond ...
research
03/04/2013

LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity

In this paper, we present a theoretical effort to connect the theory of ...

Please sign up or login with your details

Forgot password? Click here to reset