Skip navigation
Skip navigation

Asymptotically Optimal Agents

Lattimore, Tor; Hutter, Marcus

Description

Artificial general intelligence aims to create agents capable of learning to solve arbitrary interesting problems. We define two versions of asymptotic optimality and prove that no agent can satisfy the strong version while in some cases, depending on discounting, there does exist a non-computable weak asymptotically optimal agent.

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
URI: http://hdl.handle.net/1885/38019
Source: Lecture Notes in Artificial Intelligence 6925
DOI: 10.1007/978-3-642-24412-4_29

Download

File Description SizeFormat Image
01_Lattimore_Asymptotically_Optimal_A_2011.pdf259.84 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator