Books from Joe's blog
Some books that I really enjoy(ed)
It's been quite some time since I blogged about what I've been reading. That's not because I haven't been reading -- au contraire! -- but rather because I've been busy doing so. I find these posts interesting for myself, so that I can look back and see where my interests were at a particular point in time. Given the sheer number of additions, I can't properly rate them like I have in the past. Here are the more interesting ones, those that stick out in my mind:
Music
Theory of Harmony, Arnold Schoenberg. 1922.
Psychology of Music, Carl E. Seashore. 1938.
Study of Counterpoint, John J. Fux. 1965.
The Study of Fugue, Alfred Mann. 1987.
Counterpoint: The Polyphonic Vocal Style of the Sixteenth Century, Knud Jeppessen. 1992.
Johann Sebastian Bach: The Learned Musician, Christoph Wolff. 2001.
Guitar Man: A Six-String Oddyssey, or, You Love that Guitar More than You Love Me, Will Hodgkinson. 2006.
Musicophilia: Tales of Music and the Brain, Oliver Sacks. 2008.
Mathematics
Euclid's Elements (Books 1 - 13). 300 BC.
The Principia : Mathematical Principles of Natural Philosophy, Isaac Newton and Andrew Motte. 1846.
Introduction to Mathematical Logic, Alonzo Church. 1944.
Foundations of Algebraic Topology, Samuel Eilenberg and Norman Steenrod. 1952.
Foundations of Mathematical Logic, Haskell B. Curry. 1963.
Diophantus Of Alexandria -A Study In The History Of Greek Algebra, Sir Thomas L. Heath. 1964.
From Zero to Infinity: What Makes Numbers Interesting, Constance Reid. 1964.
Euclid in the Rainforest: Discovering Universal Truth in Logic and Math, Joseph Mazur. 2006.
Unknown Quantity: A Real and Imaginary History of Algebra, John Derbyshire. 2007.
God Created the Integers: The Mathematical Breakthroughs that Changed History, Stephen Hawking. 2007.
Infinite Ascent: A Short History of Mathematics (Modern Library Chronicles), David Berlinski. 2008.
Computers
LISP 1.5 Programmer's Manual, John McCarthy. 1962.
Computation: Finite and Infinite Machines, Marvin Lee Minsky. 1967.
The Theory of Parsing, Translation, and Compiling (Volume I: Parsing), Alfred V. Aho and Jeffrey D. Ullman. 1972.
The Theory of Parsing, Translation, and Compiling (Volume II: Compiling), Alfred V. Aho and Jeffrey D. Ullman. 1973.
Algorithms + Data Structures = Programs, Niklaus Wirth 1976.
A Discipline of Programming, Edsger W. Dijkstra. 1976.
Architecture of Concurrent Programs, Per Brinch Hansen. 1977.
The Elements of Programming Style, Brian W. Kernighan and P. J. Plauger. 1978.
Mindstorms: Children, Computers, And Powerful Ideas, Seymour Papert. 1980.
Selected Writings on Computing: A Personal Perspective, Edsger W. Dijkstra. 1982.
CLU: Reference Manual (Lecture Notes in Computer Science), B. Liskov, et al. 1983.
Algorithms and Data Structures, Niklaus Wirth. 1985.
Communicating Sequential Processes, C. A. R. Hoare. 1985.
The Little LISPer, Third Edition, Daniel P. Friedman and Matthias Felleisen. 1989.
Common LISP, The Language, Second Edition, Guy Steele. 1990.
The High Performance FORTRAN Handbook, Charles H. Koelbel, et. Al. 1993.
201 Principles of Software Development, Alan M. Davis. 1995.
Algol-like Languages (Progress in Theoretical Computer Science), Peter O'Hearn and Robert Tennent. 1996.
Based on this list, you might surmise that I read a lot. ;) In fact, I typically have between 3 and 5 books going simultaneously (how parallel of me), so I use the term "read" somewhat nontraditionally. I prefer to absorb the information by immersing myself in many books in the same genre simultaneously, instead of committing to a single one. This seems to be effective, but is also slightly odd and perhaps quite esoteric to other people; the result is that every room in my home is littered with books each in some possibly long-forgotten state of being "read" (along with tattered academic papers, language manuals, etc). I like it, but some people believe this is an indication that I'm a tad insane. C'est la vie.
Books from Joe's blog的更多相关文章
- MongoDB学习笔记(数据操作)
1. 批量插入: 以数组的方式一次插入多个文档可以在单次TCP请求中完成,避免了多次请求中的额外开销.就数据传输量而言,批量插入的数据中仅包含一份消息头,而多次单条插入则会在每次插入数据时封 ...
- 《Troubleshooting SQL Server》读书笔记-CPU使用率过高(下)
<Troubleshooting SQL Server>读书笔记-CPU使用率过高(下) 第三章 High CPU Utilization. CPU使用率过高的常见原因 查询优化器会尽量从 ...
- Django 1.10中文文档-执行查询
Django 1.10中文文档: https://github.com/jhao104/django-chinese-doc 只要创建好 数据模型, Django 会自动为生成一套数据库抽象的API, ...
- vue.js实战——splice使用
Vue在检测到数组变化时,并不是直接重新渲染整个列表,而是最大化地复用DOM元素.替换的数组中含有相同元素的项不会被重新渲染,因此可以大胆地用新数组来替换就数组,不用担心性能问题. 需要注意的是,以下 ...
- tomcat server.xml
基于对server.xml的学习,结合源码,可以进一步理解tomcat的架构设计 1. 2. 3. 4 .valve链 参考: http://www.importnew.com/17124.html ...
- Oracle:使用nginx做为代理访问
nginx 必须启用 启用 --with-stream 模块. 可下载源码编译. nginx.conf的配置: worker_processes ; events { worker_connectio ...
- SQL SERVER CXPACKET-Parallelism Wait Type 的惯用解决方案
最近我的两个库出现,出现较多的CXPACKET等待,在网上找了一下资料.其中有篇一个SQL Server专栏作家的文章不错,也解决了我的一些疑问,就翻译在这里. 翻译整理仅用于传播资讯之目的. 原文出 ...
- mongodb学习比较(数据操作篇)
1. 批量插入: 以数组的方式一次插入多个文档可以在单次TCP请求中完成,避免了多次请求中的额外开销.就数据传输量而言,批量插入的数据中仅包含一份消息头,而多次单条插入则会在每次插入数据时封 ...
- APS.NET MVC + EF (04)---路由和数据传递
4.1 视图引擎 ASP.NET MVC 提供两种视图引擎:ASPX(C#)和Razor(CSHTML),推荐使用Razor. 4.1.1 Razor的语法 在Razor视图中,所有的服务器端代码都是 ...
随机推荐
- HTML二(基本标签)
一.标题 HTML 标题(Heading)是通过 <h1> - <h6> 等标签进行定义的. <!--标题--> <h1>标题 1</h1> ...
- [转]intellij 13新建javaweb项目并用tomcat 7启动
来自:http://blog.csdn.net/little__zm/article/details/19570535 对intellij不熟,找了很多文章,只这篇最为顺利.其他都有各种各校的问题,先 ...
- Windows注意目录
win7: c:\windows\tracing%windir%\system32\logfiles\C:\Users\Administrator\AppData\Roaming\softC:\Use ...
- Linux系统中用stat命令查看文件的三个时间属性
在Linux中,没有文件创建时间的概念.只有文件的访问时间.修改时间.状态改变时间.也就是说无法知道文件的创建时间. [root@rhel7 yum.repos.d]# stat cdrom.repo ...
- iOS自定义从底部弹上来的View
概述 自定义蒙层弹起View,点击一下遮罩或界面上关闭按钮,页面会自动下去(从上向下) 详细 代码下载:http://www.demodashi.com/demo/10724.html 在一些少数据没 ...
- java操作hdfs到数据库或者缓存
使用hadoop工具将数据分析出来以后,须要做入库处理或者存到缓存中.不然就没了意义 一下是使用javaAPI操作hdfs存入缓存的代码: <span style="font-fami ...
- 中国城市线划分—Where do you want to develop......
- springmvc异常统一处理
http://www.cnblogs.com/xd502djj/archive/2012/09/24/2700490.html
- iOS10 推送必看 UNNotificationContentExtension
来源:徐不同(@2016徐小爷) 链接:http://www.jianshu.com/p/45933f5450a4 大伙久等啦~这绝对是最全最详细的 UNNotificationContentExte ...
- 【LeetCode】104. Maximum Depth of Binary Tree (2 solutions)
Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the ...