- -

Stochastic tasks: difficulty and Levin search

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by


Stochastic tasks: difficulty and Levin search

Show full item record

Hernández Orallo, J. (2015). Stochastic tasks: difficulty and Levin search. En Artificial General Intelligence. Springer International Publishing. 90-100. http://hdl.handle.net/10251/66686

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/66686

Files in this item

Item Metadata

Title: Stochastic tasks: difficulty and Levin search
Author: Hernández Orallo, José
Editor: Springer
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
We establish a setting for asynchronous stochastic tasks that account for episodes, rewards and responses, and, most especially, the computational complexity of the algorithm behind an agent solving a task. This is used ...[+]
Subjects: Task difficulty , Task breadth , Levin's search , Universal psychometrics
Copyrigths: Reserva de todos los derechos
ISBN: 978-3-319-21365-1
Artificial General Intelligence. (issn: 978-3-319-21364-4 )
Springer International Publishing
Publisher version: http://link.springer.com/10.1007/978-3-319-21365-1_10
Conference name: Eighth Conference on Artificial General Intelligence (AGI-15)
Conference place: Berlin, Germany
Conference date: 2015-07-22
Series: Lecture Notes in Computer Science;9205
This work has been partially supported by the EU (FEDER) and the Spanish MINECO under grants TIN 2010-21062-C02-02, PCIN-2013-037 and TIN 2013-45732-C4-1-P, and by Generalitat Valenciana PROMETEOII 2015/013.
Type: Capítulo de libro Comunicación en congreso

This item appears in the following Collection(s)

Show full item record