An Information Theoretic Representation of Agent Dynamics as Set Intersections

07/05/2011
by   Samuel Epstein, et al.
0

We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as the intersection of their respective strings, we prove complexity properties of player interactions using Algorithmic Information Theory. We show how the proposed construction is compatible with Universal Artificial Intelligence, in that the AIXI model can be seen as universal with respect to interaction.

READ FULL TEXT
research
01/16/2021

Binary strings of finite VC dimension

Any binary string can be associated with a unary predicate P on ℕ. In th...
research
10/06/2021

Reward-Punishment Symmetric Universal Intelligence

Can an agent's intelligence level be negative? We extend the Legg-Hutter...
research
02/13/2023

Universal Agent Mixtures and the Geometry of Intelligence

Inspired by recent progress in multi-agent Reinforcement Learning (RL), ...
research
07/02/2019

Are You Doing What I Think You Are Doing? Criticising Uncertain Agent Models

The key for effective interaction in many multiagent applications is to ...
research
04/03/2000

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Decision theory formally solves the problem of rational agents in uncert...
research
06/22/2018

A Universal Hypercomputer

This paper describes a type of infinitary computer (a hypercomputer) cap...
research
09/03/2022

Learning to Predict Requires Integrated Information

Embodied agents are regularly faced with the challenge to learn new task...

Please sign up or login with your details

Forgot password? Click here to reset