Epstein Secrets

, 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

istics, 2007. Wah06. Wolfgang Wahlster. SmartKom: Foundations of Multimodel Dialogue Systems. Springer, 2006. Wan06. Pei Wang. Rigid Flexibility: The Logic of Intelligence. Springer, 2006. WF05. Ian Witten and Eibe Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 2005. Win95. St

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

ess, 2010. Wan95. P. Wang. Non-Axiomatic Reasoning System. PhD Thesis, Indiana University. Bloomington, 1995. Wan06. Pei Wang. Rigid Flexibility: The Logic of Intelligence. Springer. 2006. Was09. Mark Weser. Ethics for self-improving machines. In ACf-09, 2009. http://vimeo. con/ 3 6 9 8 8 9 O. Wel90. H. Wellman. Th

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

Press, 2010. Wan95. P. Wang. Non-Aziomatic Reasoning System. PhD Thesis, Indiana University. Bloomington, 1995. Wan06. Pei Wang. Rigid Flexibility: The Logic of Intelligence. Springer, 2006. Was09. Mark Waser. Ethics for self-improving machines. In AGI-09, 2009. http: //vimeo.com/ 3698890. Wel90. H. Wellman. The Child’s