Epstein Secrets

is, 2011. CH11. N Garg and J Henderson. Temporal restricted boltzmann machines for dependency parsing. In Proc. ACL, 2011. GIII. B. Coertzel and M. Ikle. Steps toward a geometry of mind. In J Schmidhuber and K Thorisson, editors, Subm.to ACI-11. Springer, 2011. CICH08. B. Goertzel, M. Ikle, I. Goer

, 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

opment, 22:89-112, 1978. Cib79. J. J. Gibson. The Ecological Approach to Visual Perception. Boston: Houghton Mifflin, 1979. CICH08. B. Goertzel, M. Ikle, I. Goertzel, and A. Heljalcka. Probabilistic Logic Networks. Springer, 2008. Ci182. Carol Cilligan. In a Different Voice. Cambridge, MA: Harvard U

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

velopment, 22:89-112, 1978. Gib79. J. J. Gibson. The Ecological Approach to Visual Perception. Boston: Houghton Mifflin, 1979. GIGHO8. B. Goertzel, M. Ikle, I. Goertzel, and A. Heljakka. Probabilistic Logic Networks. Springer, 2008. Gil82. Carol Gilligan. In a Different Voice. Cambridge, MA: Harvard Uni

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