A jumping off point for cs topics.
CS for all – “In a nutshell, our objective is to provide an introduction to computer science as an intellectually rich and vibrant field rather than focusing exclusively on computer programming. While programming is certainly an important and pervasive element of our approach, we emphasize concepts and problem-solving over syntax and programming language features.” At Mudd, this course is taken by almost every first-year student—irrespective of the student’s ultimate major—as part of our core curriculum.
Introduction to Theoretical Computer Science “This is a textbook in preparation for an introductory undergraduate course on theoretical computer science. I am using this text for Harvard CS 121.”
The “Computer Science Field Guide” is an online interactive resource for high school students learning about computer science, developed at the University of Canterbury in New Zealand.
Constructing proofs in the context of CS
via this twitter discussion
- MIT Open Courseware’s Algorithms classes.
- Software Foundations
- Knuth’s book “Concrete mathematics for CS”
- the book “How to prove it: A structured approach” is a great book on the topic.
- How to write a proof by Leslie Lamport (pdf).
- updated How to write a 21st century proof
- Today’s paper – an interesting/influential/important paper from the world of CS every weekday morning, as selected by Adrian Colyer
- Best paper awards at AAAI, ACL, CHI, CIKM, CVPR, FOCS, FSE, ICCV, ICML, ICSE, IJCAI, INFOCOM, KDD, MOBICOM, NSDI, OSDI, PLDI, PODS, S&P, SIGCOMM, SIGIR, SIGMETRICS, SIGMOD, SODA, SOSP, STOC, UIST, VLDB, WWW
- Books and papers every graduate student should read by Matt Might
Forgotten ideas of Computer science
- Joe Armstrong, the creator of Erlang programming language, asked on twitter (2018/1/11):
“I’m interested in the forgotten ideas of computer science. Needed for a talk.Can you post examples of great CS ideas that have been largely forgotten. Examples: Linda tuple spaces, Boyer-Moore algorithm”. Fascinating response.
Linda tuple spaces (cf: Fly object space by \@NigeWarren, gigaspaces‘s commercial offering). “What are tuple spaces and Linda tuple spaces good for?” One use is the blackboard idea. Tuples are put into the space, processes observing the space can be notified of interesting tuples, ‘take’ one or all, perform work and ‘put’ new tuples into the space for other workers to pick up. Tuples can also be leased out from the space, this guarantees only one process can lease a tuple to do something with it. JavaSpaces is based on these ideas. [Argorak: Interesting. Has this influenced the idea of a “document based application” comes from in OS X? Which for example doesn’t close when the last window closed, ready for handling others?] Not really, that’s how OS 9 works also. The “document-based” thing in OS X is mostly about a way of structuring the OOP in your application to best take advantage of the builtin capabilities of NSDocument. The most OpenDoc-y idea in OS X is the little-used “Services” menu. Oddly OpenDoc DID massively influence Microsoft, who stripped down the basic concept to a less-ambitious, but much more practical, set of ideas around IPC/software components. Their version was called OLE, which became COM, which set the basic design of C#/.NET.
Transpointing windows Regex derivatives Enfilades Cord routing
Specific tech: 9p, MUMPS, XU88, network-transparent object method forwarding, icon/unicon, APL, bitmapped keyboards, literal cranks for debugging, distributed expert systems (like the 5th generation computer project)
Plan9, Xanadu, colorforth, the legacy Amiga community, & the Squeak Smalltalk community each have a greater number of interesting ideas than the whole of the web dev & devops world combined, and all those ideas are 30+ years old.
APLs and special purpose langauges, Program Synthesis For Declarative Building Design
- Croquet TeaTime protocol for synchronised distributed objects
- Arena based memory allocation
- Using make to describe artefact dependencies, instead of as a programming language
Inmos Transputer, Occam. π-calculus
OpenDoc – Briefly in the mid-90s Apple and IBM collaborated on a tech that inverted the idea of a gui “application” and refocused around “documents” as the core idea. You’d be working on a piece of data, and software would exist sort of in a cloud around your document things you previously wrote as an application would be broken down into a cloud of individual features. Features could be mixed and matched from different apps, so you could be in Word using Wordperfect’s spellchecker and editing one of the graphics using Photoshop’s tools.
1s complement arithmetic. Lissajou status trace console displays with the upper 8 address bits driving the X-axis and the lower 8 bits driving the Y-axis. Twister-card memory. BCD ALUs. ABACABAD scheduling. Leaky bucket counters. Coroutines. Buddy system. Use of XOR’ed links to traverse a list in either direction with just one link field. And, to be snarky, object-oriented programming, forgotten in about 1980 and replaced by class-oriented programming.
Bresenham’s algorithm for drawing lines and other graphic primitives
More on graphics side of things, but deferred tile-based rendering. Only PVR really explored it, but it makes so much more sense than traditional rasterization. Free z-culling, essentially infinite fill rate, no wasted rasterization. Sadly, apple ditched PVR, so likely dead tech.
MASCOT, DARTS, all those ’80s real-time system methodologies
The NetBLT protocol: net flow control/retransmission based on transferring blocks, rather than a stream like TCP.
- The Marr Hypothesis
- Multi-Agent Systems
- Boids Algorithm
- Cybernetics (or at least, it doesn’t get emphasized in CS anymore)
- Fuzzy Logic
- self modifying code
Treaps. Brzozowski derivatives. FKS perfect hashing. (TommyEttinger: Brzozowski derivatives and their successors in partial derivatives are still actively studied in some circles, though I think they have a ways to go to catch highly-optimized traditional regex libraries for efficiency. Great potential though.) (ysr1729: They have been used in decision problems in logic and computer science – e.g. for satisfiability of interval temporal logic using automat-theoretic methods.)
Orthogonal Persistence. Reflection. Fexprs. Lisp Machines. The Systems Paradigm. FORTH. The TUNES project. Having lots of simple connected CPUs with each unit of RAM, instead of a overly complex and securitywise hazardous central CPU behemoth (connection machine, greenarrays). (phenidone: Persistence: true and that makes me a little sad - my PhD on GC was implemented in an orthogonal-persistence storage layer. Reflection is still a big thing at least in Java-land, and there is a bit of a forth fanboy-revival in the microcontroller space.)
clockless flow computing
Analogous machines, ie solving a diffential differential equation by building an electric circuit with the same characteristics and then measuring the current over time.
Pattern matching as a primitive operation in a language SNOBOL
(3) Stanford Seminar - Concatenative Programming: From Ivory to Metal - YouTube