Skip navigation
Skip navigation

Asymptotically optimal agents

Lattimore, Tor; Hutter, Marcus


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-10
Type: Conference paper
Book Title: Algorithmic learning theory : 22nd international conference, ALT 2011, Espoo, Finland, October 5-7, 2011 : proceedings
DOI: 10.1007/978-3-642-24412-4_29


File Description SizeFormat Image
Lattimore and Hutter Asymptotically Optimal Agents 2011.pdf332.7 kBAdobe PDFThumbnail

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator