RE: landmark.el

[Brannon, Terrence]

-----Original Message-----
From: Emacs-devel [mailto:address@hidden On Behalf Of Stefan Monnier
Sent: Thursday, December 6, 2018 5:38 PM
To: address@hidden
Subject: Re: landmark.el [ EXTERNAL ]

> I would like to provide some edits to the Full description we see at 
> https://urldefense.proofpoint.com/v2/url?u=http-3A__elpa.gnu.org_packa
> ges_landmark.html&d=DwIBAg&c=huW-Z3760n7oNORvLCN2eBo-Ehm9Q_bNeNJaAMovB
> jQ&r=uvXYcBD4O7n5Ah7cexUTOH7HUSodf0nzeN28F7OKuAxMhDsehRnahd_yZf-XdItD&
> m=PmF4jAwV81WZV7zgW48Napnf_K7g2FkuV_y4AH8pVLU&s=M1uQx1mJCjOH-xScnPfxdz
> uhLZmHUDJjGiOJrfQLaIw&e=
>
> Apparently this would be done by supplying a pull request to the 
> actual source code -

>> You can send a patch here or via M-x report-emacs-bug (or directly to me).

c:\prg\landmark>git diff landmark.el 
git diff landmark.el 
diff --git a/landmark.el b/landmark.el
index 9b48901..b1ffd8a 100644
--- a/landmark.el
+++ b/landmark.el
@@ -2,7 +2,7 @@
 
 ;; Copyright (C) 1996-1997, 2000-2016 Free Software Foundation, Inc.
 
-;; Author: Terrence Brannon (was: <address@hidden>)
+;; Author: Terrence Brannon <address@hidden>
 ;; Created: December 16, 1996 - first release to usenet
 ;; Keywords: games, neural network, adaptive search, chemotaxis
 ;; Maintainer: address@hidden
@@ -34,7 +34,7 @@
 ;; the smell of the tree increases, then the weights in the robot's
 ;; brain are adjusted to encourage this odor-driven behavior in the
 ;; future. If the smell of the tree decreases, the robots weights are
-;; adjusted to discourage a correct move.
+;; adjusted to discourage that odor-driven behavior.
 
 ;; In laymen's terms, the search space is initially flat. The point
 ;; of training is to "turn up the edges of the search space" so that
@@ -51,6 +51,13 @@
 ;; a single move, one moves east,west and south, then both east and
 ;; west will be improved when they shouldn't
 
+;; The source code was developed as part of a course on Brain Theory
+;; and Neural Networks at the University of Southern California. The
+;; original problem description and solution appeared in 1981 in the
+;; paper "Landmark Learning: An Illustration of Associative
+;; Search" authored by Andrew G. Barto and Richard S. Sutton and
+;; published to Biological Cybernetics.
+
 ;; Many thanks to Yuri Pryadkin <address@hidden> for this
 ;; concise problem description.



This e-mail transmission may contain information that is proprietary, 
privileged and/or confidential and is intended exclusively for the person(s) to 
whom it is addressed. Any use, copying, retention or disclosure by any person 
other than the intended recipient or the intended recipient's designees is 
strictly prohibited. If you are not the intended recipient or their designee, 
please notify the sender immediately by return e-mail and delete all copies. 
OppenheimerFunds may, at its sole discretion, monitor, review, retain and/or 
disclose the content of all email communications.