comparison org/sussman-reading-list.org @ 107:7db6af8be6fb

add more links.
author rlm
date Tue, 03 Jun 2014 13:19:41 -0400
parents 616f461ec98d
children 174455d6d0ba
comparison
equal deleted inserted replaced
106:616f461ec98d 107:7db6af8be6fb
216 - [[http://hdl.handle.net/1721.1/6888][A System for Representing and Using Real-World Knowledge]] 216 - [[http://hdl.handle.net/1721.1/6888][A System for Representing and Using Real-World Knowledge]]
217 - By [[http://www.cs.cmu.edu/~sef/][Scott Elliot Fahlman]], 1977 217 - By [[http://www.cs.cmu.edu/~sef/][Scott Elliot Fahlman]], 1977
218 - Basically the reason that the Connection Machine was later 218 - Basically the reason that the Connection Machine was later
219 invented. 219 invented.
220 220
221 - The Connection Machine 221 - [[http://hdl.handle.net/1721.1/5679][The Connection Machine]]
222 - By Danny Hillis, 1981 222 - By [[http://longnow.org/people/board/danny0/][Danny Hillis]], 1981
223 - Beautiful thesis, but it doesn't tell you anything you can 223 - Beautiful thesis, though it doesn't tell you anything you can
224 really /do/ today. 224 really /do/ today.
225 225
226 - A Circuit Grammar For Operational Amplifier Design 226 - [[http://hdl.handle.net/1721.1/6948][A Circuit Grammar For Operational Amplifier Design]]
227 - By Andrew Ressler, 1984 227 - By Andrew Ressler, 1984
228 - If you're an Electrical Engineering person. 228 - If you're an Electrical Engineering person.
229 229
230 - ONTIC: A Knowledge Representation System for Mathematics 230 - [[http://hdl.handle.net/1721.1/6959][ONTIC: A Knowledge Representation System for Mathematics]]
231 - By David A. McAllester, 1987 231 - By [[http://ttic.uchicago.edu/~dmcallester/][David A. McAllester]], 1987
232 - Very hard, very deep. 232 - Very hard, very deep.
233 - You will need to know a lot of Math. 233 - You will need to know a lot of Math.
234 234
235 - KAM: Automatic Planning and Interpretation of Numerical 235 - [[http://hdl.handle.net/1721.1/7025][KAM: Automatic Planning and Interpretation of Numerical
236 Experiments Using Geometrical Methods 236 Experiments Using Geometrical Methods]]
237 - By Kenneth Man-Kam Yip, 1989 237 - By Kenneth Man-Kam Yip, 1989
238 - Coolest PhD thesis ever! 238 - Coolest PhD thesis ever!
239 - Solve problems using graphs. 239 - Solve problems using graphs.
240 - So cool! 240 - So cool!
241 241
242 - Botanical Computing: A Developmental Approach to Generating 242 - [[http://hdl.handle.net/1721.1/80483][Botanical Computing: A Developmental Approach to Generating
243 Interconnect Topologies on an Amorphous Computer 243 Interconnect Topologies on an Amorphous Computer]]
244 - By Daniel Coore, 1999 244 - By [[http://sta.uwi.edu/pelican/60under60/dcoore.asp][Daniel Coore]], 1999
245 - Interesting to programmers especially. 245 - Interesting to programmers especially.
246 246
247 - Programmable Self-Assembly: Constructing Global Shape using 247 - [[http://hdl.handle.net/1721.1/86667][Programmable Self-Assembly: Constructing Global Shape using
248 Biologically-inspired Local Interactions and Origami Mathematics 248 Biologically-inspired Local Interactions and Origami Mathematics]]
249 By Radhika Nagpal, 2001 249 By [[http://www.eecs.harvard.edu/~rad/][Radhika Nagpal]], 2001
250 - Also Interesting to programmers. 250 - Also Interesting to programmers.
251 251
252 - Cellular Computation and Communications using Engineered Genetic 252 - [[http://hdl.handle.net/1721.1/8228][Cellular Computation and Communications using Engineered Genetic
253 Regulatory Networks 253 Regulatory Networks]]
254 - By Ron Weiss, 2001 254 - By [[http://groups.csail.mit.edu/mac/users/rweiss/][Ron Weiss]], 2001
255 - Third in a line of bio-papers which should be highly interesting 255 - Third in a line of bio / amorphous computing papers which should
256 to programmers. 256 be highly interesting to programmers.
257 257
258 - [[http://hdl.handle.net/1721.1/6082][An Algorithm for Bootstrapping Communications]] 258 - [[http://hdl.handle.net/1721.1/6082][An Algorithm for Bootstrapping Communications]]
259 - By Jake Beal, 2001 259 - By Jake Beal, 2001
260 - Seems like it could be "the right thing" for how modules in the 260 - Seems like it could be "the right thing" for how modules in the
261 brain learn to talk to each other. 261 brain learn to talk to each other.