Epstein Secrets

NOO. George Lakoff and Rafael Nunez. Where Mathematics Comes From. Basic Books, 2000. Loo06. Moshe Looks. Competent Program Evolution. PhD Thesis, Computer Science Department, Wash- ington University, 2006. Loo07a. M. Looks. On the behavioral diversity of random programs. In Genetic and evolutionary compu- tation confere

r the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. • Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conse

ve its fingers to pick up a cup, coordinating its movements with its visual perceptions. It's certainly possible to represent this sort of thing in Combo, but Combo may be an awkward tool. However, if one represents low-level procedures like this using another method, e.g. learned cell assemblies in a

the question of programs in what programming language, and in this context we have made a fairly traditional choice, using a special language called Combo that is essentially a minor variant of LISP, and supplying Combo with a set of customized primitives intended to reduce the length of the typical p

2000. Log07. Robert M. Logan. The Extended Mind. University of Toronto Press. 2007. Loo06. Moshe Looks. Competent Program Evolution. PhD Thesis, Computer Science Department, Wash- ington University, 2006. LRN87. John Laird, Paul Rosenbloom, and Alan Newell. Soar: An architecture for general intelligence. Artificial In

r the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. • Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conse

p the rules might profitably be ported into the Atomspace as ImplicationLinks. • Representation Building: A stage within MOSES, wherein a candidate Combo program tree (within a deme) is modified by replacing one or more tree nodes with alternative tree nodes, thus obtaining a new, different candidate

s, 2000. Log07. Robert M. Logan. The Extended Mind. University of Toronto Press, 2007. Loo06. Moshe Looks. Competent Program Evolution. PhD Thesis, Computer Science Department, Wash- ington University, 2006. LRN87. John Laird, Paul Rosenbloom, and Alan Newell. Soar: An architecture for general intelligence. Artificial Inte

d up the rules might profitably be ported into the Atomspace as ImplicationLinks. Representation Building: A stage within MOSES, wherein a candidate Combo program tree (within a deme) is modified by replacing one or more tree nodes with alternative tree nodes, thus obtaining a new, different candidate p

her the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. e Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conseq