Measuring Intelligence and Growth Rate: Variations on Hibbard’s Intelligence Measure
暂无分享,去创建一个
[1] W. Luxemburg. Non-Standard Analysis , 1977 .
[2] R. Goldblatt. Lectures on the hyperreals : an introduction to nonstandard analysis , 1998 .
[3] Bill Hibbard. Measuring Agent Intelligence via Hierarchies of Environments , 2011, AGI.
[4] A. Robinson. Non-standard analysis , 1966 .
[5] Gregory J. Chaitin. Metaphysics, Metamathematics and Metabiology , 2011 .
[6] Samuel Allen Alexander,et al. Intelligence via ultrafilters: structural properties of some intelligence comparators of deterministic Legg-Hutter agents , 2019, J. Artif. Gen. Intell..
[7] Roman V. Yampolskiy,et al. Turing Test as a Defining Feature of AI-Completeness , 2013, Artificial Intelligence, Evolutionary Computing and Metaheuristics.
[8] Donald E. Knuth,et al. Big Omicron and big Omega and big Theta , 1976, SIGA.
[9] P. Ciaran O'Kane. On Numbers and Games , 1978 .
[10] Karel Hrbacek,et al. Infinitesimal analysis without the Axiom of Choice , 2020, Ann. Pure Appl. Log..
[11] Dr. Marcus Hutter,et al. Universal artificial intelligence , 2004 .
[12] Marcus Hutter,et al. Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[13] Pei Wang,et al. On Defining Artificial Intelligence , 2019, J. Artif. Gen. Intell..
[14] Samuel Allen Alexander. The Archimedean trap: Why traditional reinforcement learning will probably not yield AGI , 2020, J. Artif. Gen. Intell..
[15] I. Good. GÖDEL'S THEOREM IS A RED HERRING , 1969, The British Journal for the Philosophy of Science.
[16] Andreas Weiermann,et al. Slow Versus Fast Growing , 2002, Synthese.
[17] Samuel Allen Alexander. Measuring the intelligence of an idealized mechanical knowing agent , 2019, SEFM Workshops.
[18] Andreas Weiermann,et al. Sometimes Slow Growing is Fast Growing , 1997, Ann. Pure Appl. Log..
[19] Roman V. Yampolskiy,et al. AI-Complete, AI-Hard, or AI-Easy - Classification of Problems in AI , 2012, MAICS.
[20] Stanley S. Wainer. Slow Growing Versus Fast Growing , 1989, J. Symb. Log..
[21] S. Wainer,et al. Provably computable functions and the fast growing hierarchy , 1987 .
[22] R.K. Guy,et al. On numbers and games , 1978, Proceedings of the IEEE.
[23] Jean-Yves Girard,et al. Π12-logic, Part 1: Dilators , 1981 .
[24] Shih-chao Liu. AN ENUMERATION OF THE PRIMITIVE RECURSIVE FUNCTIONS WITHOUT REPETITION , 1960 .
[25] Dieter Sondermann,et al. Arrow's theorem, many agents, and invisible dictators☆ , 1972 .
[26] Philip Ehrlich,et al. The Absolute Arithmetic Continuum and the Unification Of all Numbers Great and Small , 2012, The Bulletin of Symbolic Logic.
[27] Nick Bostrom,et al. Ethical Issues in Advanced Artificial Intelligence , 2020 .
[28] Shane Legg,et al. Is There an Elegant Universal Theory of Prediction? , 2006, ALT.
[29] Samuel Allen Alexander,et al. AGI and the Knight-Darwin Law: why idealized AGI reproduction requires collaboration , 2020, AGI.
[30] Bill Hibbard. Adversarial Sequence Prediction , 2008, AGI.