Epstein Secrets

CPC+ 11. Ben Coertzel, Joel Pitt, Zhenhua Cai, Jared Wigmore, Deheng Huang., Nil Geisweiller, Ruiting

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

nCog system, including Linas Vepstas, Joel Pitt, Jared Wigmore / Jade O'Neill, Zhenhua Cal, Deheng Huang

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

enCog system, including Linas Vepstas, Joel Pitt, Jared Wigmore / Jade O'Neill, Zhenhua Cai, Deheng Huang

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

. GPC? 11. Ben Goertzel, Joel Pitt, Zhenhua Cai, Jared Wigmore, Deheng Huang, Nil Geisweiller, Ruiting L

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