summary refs log tree commit diff stats
diff options
context:
space:
mode:
authorscrewtape <screwtape@sdf.org>2023-05-11 09:54:14 +0000
committerscrewtape <screwtape@sdf.org>2023-05-11 09:54:14 +0000
commit8e158e9bc630b8086c505b463fc848caa03442d8 (patch)
tree79c0e6e7475d3ce0c7e80838843fa1d5c77a82a0
parente41bc41221f9fcbccca4d3a252128ed84240edf3 (diff)
downloadbinry-hop-book-8e158e9bc630b8086c505b463fc848caa03442d8.tar.gz
/exponential/quadratic/ HEAD master
-rw-r--r--01-autoassociative-memory.txt2
1 files changed, 1 insertions, 1 deletions
diff --git a/01-autoassociative-memory.txt b/01-autoassociative-memory.txt
index 85871ba..4b3786e 100644
--- a/01-autoassociative-memory.txt
+++ b/01-autoassociative-memory.txt
@@ -13,7 +13,7 @@ converge to a specific memory.
 * Wait, what?
 Instead of starting from the beginning or the end I'm going to start
 from the middle. The following is a useful common lisp implementation
-of Hopfield nets using a rectified exponential function. Details of
+of Hopfield nets using a rectified quadratic function. Details of
 the common lisp package are in the appendix.
 
 The rest of this book will be a deconstruction of this function with