You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Changes:
- add: *Combinatorial Analysis and Computers* (1965) to
`combinatory_logic/README.md` list
- add: year to the other paper in the README
- fix: tweak format of papers README for readability
Decisions:
- I put this in the `combinatory_logic` folder, but I think it would
also fit in the `comp_sci_fundamentals_and_history` folder (given
Knuth's historical importance to the field and the more
theoretical nature of the paper). This seemed more direct.
---
Paper Title: Combinatorial Analysis and Computers
Author(s): Marshall Hall Jr. and Donald E. Knuth
Paper Year: 1965
Reasons for Including Paper:
Papers We Love DC/NoVA will be discussing this paper (and others) at our
November meetup.
This paper is included in Donald Knuth's book *Selected Papers
on Discrete Mathematics*. Knuth's writings have been extremely
important to the field of computer science, and I think that most of
his papers would fit in well here. This one introduces computational
complexity and the benefits/limits of computing, then it dives into
several combinatorial problems.
I find it interesting because 1) it's a neat view of the possibilities and
limitations of computation early on, and 2) the problems that he lays out
are interesting exercises even today.
*[Flattening Combinators: Surviving Without Parentheses](http://www.westpoint.edu/eecs/SiteAssets/SitePages/Faculty%20Publication%20Documents/Okasaki/jfp03flat.pdf) by Chris Okasaki
3
+
*[Flattening Combinators: Surviving Without Parentheses]
4
+
by Chris Okasaki (2003)
5
+
6
+
*[Combinatorial Analysis and Computers]
7
+
by Marshall Hall Jr. and Donald E. Knuth (1965)
8
+
9
+
[Flattening Combinators: Surviving Without Parentheses]:
0 commit comments