An Approximation of the Universal Intelligence Measure Shane Legg and Joel Veness November 2011

First Page		Document Content
Date: 2011-11-16 08:45:57 Applied mathematics Turing machine Theory of computation Alan Turing Kolmogorov complexity Ray Solomonoff Algorithm Turing completeness Computability Theoretical computer science Computer science Computability theory		An Approximation of the Universal Intelligence Measure Shane Legg and Joel Veness November 2011 Add to Reading List Source URL: www.vetta.org Download Document from Source Website File Size: 203,01 KB Share Document on Facebook

	Additively efficient universal computers Daniel Dewey∗ Oxford Martin Programme on the Impacts of Future Technology, Future of Humanity Institute DocID: 1p8Jt - View Document
	Computational Irreducibility and Computational Analogy DocID: 1oSWH - View Document
	Safety to the Weak! Security Through Feebleness: An Unorthodox Manifesto Rick McGeer, US Ignite Outline DocID: 1oxcp - View Document
	The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD DocID: 1fMId - View Document
	Totality versus Turing-Completeness? Conor McBride University of Strathclyde Abstract. In this literate Agda paper, I show that general recursive definitions can be represented in the free mon DocID: 1fpDw - View Document