Epstein Secrets

al Conference of the Cognitive Science Society, 1993. Lai12. John E Laird. The Soar Cognitive Architecture. MIT Press, 2012. LBHIO. Jens Lehmann, Sebastian Bader, and Pascal Hitzler. Extracting reduced logic programs from artificial neural networks. Applied Intelligence, 2010. LDA05. Ramon Lopez, Cozar Delg

, ImplicationLink, etc.) or a fuzzy value (as in MemberLink, EvaluationLink). • Strong Self-Modification: This is generally used as synonymous with Self-Modification, in a CogPrime context. • Subsymbolic: Involving processing of data using elements that have no correspondence to natural language terms, nor abst

al Journal of Machine Consciousness., 2009. bGBK02. 1. Goertzel, Andrei Klimov Ben, and Arkady Klimov. Supercompiling java programs, 2002. BII05. Sebastian Bader and Pascal Ritzier. Dimensions of neural-symbolic integration - a structured survey. In S. Artemov, H. Barringer, A. S. d'Avila Garcez, L. C. Lamb,

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

onal Journal of Machine Consciousness., 2009. bGBKO2. 1. Goertzel, Andrei Klimov Ben, and Arkady Klimov. Supercompiling java programs, 2002. BHO5. Sebastian Bader and Pascal Hitzler. Dimensions of neural-symbolic integration - a structured survey. In 8S. Artemov, H. Barringer, A. 5. d’Avila Garcez, L. C. Lamb,

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