1.1 --- a/org/sussman-reading-list.org	Tue Jun 03 13:09:25 2014 -0400
     1.2 +++ b/org/sussman-reading-list.org	Tue Jun 03 13:19:41 2014 -0400
     1.3 @@ -218,42 +218,42 @@
     1.4      - Basically the reason that the Connection Machine was later
     1.5        invented.
     1.6  
     1.7 -  - The Connection Machine 
     1.8 -    - By Danny Hillis, 1981
     1.9 -    - Beautiful thesis, but it doesn't tell you anything you can
    1.10 +  - [[http://hdl.handle.net/1721.1/5679][The Connection Machine]]
    1.11 +    - By [[http://longnow.org/people/board/danny0/][Danny Hillis]], 1981
    1.12 +    - Beautiful thesis, though it doesn't tell you anything you can
    1.13        really /do/ today.
    1.14  
    1.15 -  - A Circuit Grammar For Operational Amplifier Design
    1.16 +  - [[http://hdl.handle.net/1721.1/6948][A Circuit Grammar For Operational Amplifier Design]]
    1.17      - By Andrew Ressler, 1984
    1.18      - If you're an Electrical Engineering person.
    1.19  
    1.20 -  - ONTIC: A Knowledge Representation System for Mathematics
    1.21 -    - By David A. McAllester, 1987
    1.22 +  - [[http://hdl.handle.net/1721.1/6959][ONTIC: A Knowledge Representation System for Mathematics]]
    1.23 +    - By [[http://ttic.uchicago.edu/~dmcallester/][David A. McAllester]], 1987
    1.24      - Very hard, very deep.
    1.25      - You will need to know a lot of Math.
    1.26  
    1.27 -  - KAM: Automatic Planning and Interpretation of Numerical
    1.28 -    Experiments Using Geometrical Methods
    1.29 +  - [[http://hdl.handle.net/1721.1/7025][KAM: Automatic Planning and Interpretation of Numerical
    1.30 +    Experiments Using Geometrical Methods]]
    1.31      - By Kenneth Man-Kam Yip, 1989
    1.32      - Coolest PhD thesis ever!
    1.33      - Solve problems using graphs.
    1.34      - So cool!
    1.35  
    1.36 -  - Botanical Computing: A Developmental Approach to Generating
    1.37 -    Interconnect Topologies on an Amorphous Computer
    1.38 -    - By Daniel Coore, 1999
    1.39 +  - [[http://hdl.handle.net/1721.1/80483][Botanical Computing: A Developmental Approach to Generating
    1.40 +    Interconnect Topologies on an Amorphous Computer]]
    1.41 +    - By [[http://sta.uwi.edu/pelican/60under60/dcoore.asp][Daniel Coore]], 1999
    1.42      - Interesting to programmers especially.
    1.43  
    1.44 -  - Programmable Self-Assembly: Constructing Global Shape using
    1.45 -    Biologically-inspired Local Interactions and Origami Mathematics
    1.46 -    By Radhika Nagpal, 2001
    1.47 +  - [[http://hdl.handle.net/1721.1/86667][Programmable Self-Assembly: Constructing Global Shape using
    1.48 +    Biologically-inspired Local Interactions and Origami Mathematics]]
    1.49 +    By [[http://www.eecs.harvard.edu/~rad/][Radhika Nagpal]], 2001
    1.50      - Also Interesting to programmers.
    1.51  
    1.52 -  - Cellular Computation and Communications using Engineered Genetic
    1.53 -    Regulatory Networks
    1.54 -    - By Ron Weiss, 2001
    1.55 -    - Third in a line of bio-papers which should be highly interesting
    1.56 -      to programmers.
    1.57 +  - [[http://hdl.handle.net/1721.1/8228][Cellular Computation and Communications using Engineered Genetic
    1.58 +    Regulatory Networks]]
    1.59 +    - By [[http://groups.csail.mit.edu/mac/users/rweiss/][Ron Weiss]], 2001
    1.60 +    - Third in a line of bio / amorphous computing papers which should
    1.61 +      be highly interesting to programmers.
    1.62  
    1.63    - [[http://hdl.handle.net/1721.1/6082][An Algorithm for Bootstrapping Communications]] 
    1.64      - By Jake Beal, 2001