The possibility of a framework based on a utility function that is internal to the learning subject and independent of the environment is discussed, which should measure the amount of information extracted from the interaction with the environment.Expand

A number of well known informal definitions of human intelligence are taken, and mathematically formalised to produce a general measure of intelligence for arbitrary machines that formally captures the concept of machine intelligence in the broadest reasonable sense.Expand

A novel Local Distance-based Outlier Factor (LDOF) to measure the outlier-ness of objects in scattered datasets which is less sensitive to parameter values and compares favorably to classical KNN and LOF based outlier detection.Expand

This article is a brief guide to the field of algorithmic information theory, its underlying philosophy, the major subfields, applications, history, and a map of the field are presented.Expand

Texts in Theoretical Computer Science. An EATCSâ€¦

2005

TLDR

Reading a book as this universal artificial intelligence sequential decisions based on algorithmic probability and other references can enrich your life quality.Expand

This chapter is a survey of a large number of informal definitions of â€śintelligenceâ€ť that the authors have collected over the years, which are, to the authors' knowledge, the largest and most well referenced collection there is.Expand

A new bound is proved for a modified version of Upper Confidence Reinforcement Learning (ucrl) with only cubic dependence on the horizon, which is unimprovable in all parameters except the size of the state/action space, where it depends linearly on the number of non-zero transition probabilities.Expand

This paper provides the first computationally feasible approximation to the AIXI agent, and introduces a new Monte-Carlo Tree Search algorithm along with an agent-specific extension to the Context Tree Weighting algorithm.Expand

An algorithm M is described that solves any well-defined problem p as quickly a the fastest algorithm computing a solution to p, save for a factor of 5 and low-order additive terms. M optimallyâ€¦ Expand