Difference between revisions of "Computer science"
Jump to navigation
Jump to search
EndreyMark (talk | contribs) m (add headline ,,Introduction'') |
EndreyMark (talk | contribs) (Motto: Computer Science is no more about computers than astronomy is about telescopes. Motto: ,,Computer Science is no more about computers than astronomy is about telescopes'' by E. W. Dijkstra) |
||
Line 1: | Line 1: | ||
__TOC__ |
__TOC__ |
||
+ | |||
+ | ''Computer Science is no more about computers than astronomy is about telescopes''. |
||
+ | |||
+ | -- E. W. Dijkstra |
||
== Introduction == |
== Introduction == |
||
Line 5: | Line 9: | ||
Wikipedia's [http://en.wikipedia.org/wiki/Computer_science Computer science]. |
Wikipedia's [http://en.wikipedia.org/wiki/Computer_science Computer science]. |
||
− | [http://www.cs.bham.ac.uk/~mhe/ Martín Escardó] maintains a [http://www.math.niu.edu/~rusin/known-math/index/68-XX.html Computer science] page, being both detailed and comprehensive. |
+ | [http://www.cs.bham.ac.uk/~mhe/ Martín Escardó] maintains a [http://www.math.niu.edu/~rusin/known-math/index/68-XX.html Computer science] page, being both detailed and comprehensive. The Dijkstra-quotation cited above comes from this page. |
[http://mitpress.mit.edu/sicp/full-text/book/book.html Structure and Interpretation of Computer Programs] (by Harold Abelson and Gerald Jay Sussman |
[http://mitpress.mit.edu/sicp/full-text/book/book.html Structure and Interpretation of Computer Programs] (by Harold Abelson and Gerald Jay Sussman |
Revision as of 16:57, 22 April 2006
Computer Science is no more about computers than astronomy is about telescopes.
-- E. W. Dijkstra
Introduction
Wikipedia's Computer science.
Martín Escardó maintains a Computer science page, being both detailed and comprehensive. The Dijkstra-quotation cited above comes from this page.
Structure and Interpretation of Computer Programs (by Harold Abelson and Gerald Jay Sussman with Julie Sussman, foreword by Alan J. Perlis).
Computability theory
Wikipedia's Computability theory.
An interesting area related to computabilty theory: Exact real arithmetic. For me, it was surprising, how it connected problems in mathematical analysis, arithmetic and computability theory.