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视图中,所有的服务器端代码都是 ...
随机推荐
- [SQL]查询某一个字段在某一段时期数据库中使用到的记录
有些时候我们常常须要哪里用到了一些表,又或者什么时候运行了某一个存储过程.整理出了在某段时期内数据库运行的sql查询.也能够查询到数据库中某些字段的存放处.非常好非常强大.希望能帮到大家~ SELEC ...
- SVN diff 笔记
SVN diff命令在实际中经常使用,在此记录使用点滴. #对比工作文件与缓存在.svn的“原始”拷贝: svn diff #显示工作文件和服务器版本2的不同: svn diff -r 2 #显示分支 ...
- Emmet初探2
关于Emmet Emmet插件的前身是Zen coding,可以大幅度提高前端开发效率的一个工具,也有人说类似于jade(高性能的模板引擎,它深受 Haml 影响,它是用 JavaScript 实现的 ...
- 图说十大数据挖掘算法(一)K最近邻算法
如果你之前没有学习过K最近邻算法,那今天几张图,让你明白什么是K最近邻算法. 先来一张图,请分辨它是什么水果 很多同学不假思索,直接回答:“菠萝”!!! 仔细看看同学们,这是菠萝么?那再看下边这这张图 ...
- webpack entry和output配置属性
1.entry entry的三种配置方式: (1)传递字符串: 单个入口语法:传递一个字符串 entry: './src/js/main.js', (2)传递数组 将创建“多个主入口(multi-ma ...
- Windows 10 Pro_Ent Insider Preview x86 x64 10147中文版激活
点击激活windows输入密钥:CC6JP-VN67C-8KCJ4-4V48V-HXM9B然后下载附件中的程序解压后运行注销即可激活企业版:在专业版基础上输入升级密钥:CKFK9-QNGF2-D34F ...
- Openerp 7 view画面编辑/创建/删除/复制功能控制
OpenERP 7.0中,Tree或Form画面上可以添加属性create edit delete,用于控制Create.Delete.Edit.Duplicate功能是否显现.如下例:<for ...
- HDU 5358 First One(枚举)
这道题假设依照表达式一个个来算肯定超时,下午时候想了一个O(nlogn*logn)的算法.可是t了.由于这道题卡的很紧几百个例子,必须nlogn的算法才干够ac 回到这道题,考虑log(sum(i,j ...
- eclipse查看源码失败总结
之前看的网上查看源码的方法,查看了JDK,只是知其然不知所以然. 后来发现要是查看其他源码,总是查看失败. 最开始每次点击Attach Source包到所要查看源码的jar包,但是还是这样. 但是依 ...
- 24、java操作xml方法
XML解析方式 1. SAX解析方式 SAX(simple API for XML)是一种XML解析的替代方法.相比于DOM,SAX是一种速度更快,更有效的方法.它逐行扫描文档,一边扫描一边解析.而且 ...