Epstein Secrets

ki, hamar Arel, Mark Waser, Randal Koene, Paul Rosenbloom, Zhongzhi Shi, Steve Omohundro, Bill Hibbard, Eray Ozkural, Brandon Rohrer, Ben Johnston, John Laird, Shane Legg, Selmer Brin&sjord, Anders Sandberg, Alexei Samsonovich, Wlodek Duch, and more • The inimitable "Artilect Warrior" Hugo de Gans, who (w

Supercompilation 319 18.3.1 Three Aspects of Supercompilation 321 18.3.2 Supercompilation for Goal-Directed Program Modification 322 18.4 Self-Modification via Theorem-Proving 323 A Glossary 325 A.1 List of Specialized Acronyms 325 A.2 Glossary of Specialized Terms 326 References 343 EFTA006

October 2008. Some of the ideas also trace back to discussions held during two workshops on "Evaluation and Metrics for Human-Level Al" organized by John Laird and Pat Langley (one in Ann Arbor in late 2008, and one in Tempe in early 2009). Some of the conclu- sions of the Ann Arbor workshop were recorded i

cision graph looks like: Input: List L Output: List If ( P1 (L) ) N1(L) Else If ( P2 (L) ) N2 (L) Else If ( Pk (L) ) Nk(L) EFTA00624098 18.4 Self-Modification via Theorem-Proving 323 where the Pi are predicates, and the Ni are schemata corresponding to other nodes of the decision graph (children of the c

ski, Itamar Arel, Mark Waser, Randal Koene, Paul Rosenbloom, Zhongzhi Shi, Steve Omohundro, Bill Hibbard, Eray Ozkural, Brandon Rohrer, Ben Johnston, John Laird, Shane Legg, Selmer Bringsjord, Anders Sandberg, Alexei Samsonovich, Wlodek Duch, and more The inimitable "Artilect Warrior" Hugo de Garis, who (whe

cts of Supercompilation .............0..00 000022 eee eee ee 321 18.3.2 Supercompilation for Goal-Directed Program Modification............. 322 18.4 Self-Modification via Theorem-Proving ........... 0.00 eee eee eee 323 A Glossary ..... 0.00000 tne teen eee 325 A.1 List of Specialized Acronyms.........0.. 00 0c ce

October 2008. Some of the ideas also trace back to discussions held during two workshops on "Evaluation and Metrics for Human-Level AI" organized by John Laird and Pat Langley (one in Ann Arbor in late 2008, and one in Tempe in early 2009). Some of the conclu- sions of the Ann Arbor workshop were recorded in

nt decision graphs. The decision graph leading to maximal optimization, may not be the one that leads CogPrime cognition in optimal directions. 18.4 Self-Modification via Theorem-Proving Supercompilation is a potentially very valuable tool for self-modification. If one wants to take an existing schema and graduall