Lecture 1A: Overview and Introduction to Lisp on HackerTube: recommended by 10 Hacker News commenters across 10 separate months, 2019–2026.
lecture · intro · evergreen
The first lecture of MIT's 6.001 (SICP) with Abelson and Sussman, giving an overview of the course and an introduction to Lisp. It argues that computer science is about managing complexity and abstraction, not computers.
HN people recommend the SICP lectures as a deeper, livelier route into the book and a formative course even for seasoned programmers.
“I watched and cannot recommend it enough, even for seasoned programmers”
20 Hacker News comments link this video. Each one links back to its thread.
Not even a second of thought: Sussman's & Abelson's SICP ▶ this video especially the section on streams ( [link] ) It changed my outook on programming by pi degrees and I feel it is more needed then ever.
in “Ask HN: What's the best lecture series you've ever seen?” · View on HN
It's on-demand on YouTube[1] and an excellent course that is still very much relevant with very high production quality circa 1986. What makes it special is who is teaching it, which is the original authors of SICP. The course thus completely complements their book and is in the same style. The courses from later years are also on YouTube, but they don't feel the same. [1] ▶ this video
in “24/7 SICP 1986 lectures stream” · View on HN
The class mentioned in the article was actually made available under Creative Commons by the MIT OpenCourseWare[1], you can see the entirely of the course in Youtube. I watched and cannot recommend it enough, even for seasoned programmers [1]: ▶ this video
in “Not Lisp again (2009)” · View on HN
The real beauty is in how few operators you need to achieve maximal expressiveness in a programming language. It makes other programming languages seem extra. Highly recommend the SICP lectures ▶ this video
in “Ask HN: What new programming languages did you learn in 2020?” · View on HN
Learn LISP/Scheme and lots of fundamental concepts you probably have a feel for, but in a far more profound way: 1. First watch the SICP series ( ▶ this video ) 2. Then work through the book ( [link] ) If you really do the exercises (an hour here and an hour there), you can feel you brain getting wrapped around many core notions in very illuminating ways.
in “Ask HN: How to rediscover the joy of programming?” · View on HN
There are a lot of good books here: [link] I second the comment ( [link] ) recommending How to Design Programs (HTDP) and Structure and Interpretation of Computer Programs (SICP). The former has an edX course ( [link] and [link] ) and the latter has online lectures ( ▶ this video ) Head First Architecture ( [link] ) is good. Reading about systems thinking would be useful. Learning programming languages that have been well designed is helpful. I suggest Programming Erlang: Software for a Concurrent World and Elixir in Action .
in “Ask HN: Any advice on how to learn good software architecture practices?” · View on HN
Here is Harold Abelson discussing the topic in ~1986. His introduction to “Computer Science” has stuck with me for years. Interesting to see the lineage of the statement, it must have stuck with him as it has for me, when he first heard it. ▶ this video
in ““Computer science is not about computers”” · View on HN
Maybe more of the hype comes from the fact that its a Lisp. To get a feeling for the "magic" of lisp, I would suggest either watching SICP video lecs[0] or reading the book. I started learning lisp, almost the same time I've started learning programming with Java (college). Honestly I was thinking why they don't just teach us that, instead of Java at that time. Also Clojure is created by a fairly respected dude (afaik) Rich Hickey. His talks and Clojure design decision articles on the site are really insightful. Also this talk[1] also pretty good overview of different paradigms and `Clojure way`, imo. [0] ▶ this video [1] [link]
in “How I became a better programmer (2017)” · View on HN
I’ve included the halting problem, but omitted the Turing machine, because while ingenious, the latter is simply a hack to make proofs work and not a very good way to think about computation. Similarly, I’ve included distributed representations, but omitted backpropagation since while backprop works very well for a number of problems that are otherwise unsolvable today, it is not a particularly enlightening way to write programs. Also, the first 10 minutes of the introductory SICP lecture contains a livelier presentation of the idea in the quote: ▶ this video
in “Ask HN: Which of our ideas about computation could survive a thousand years?” · View on HN
The original course videos are on youtube too! I found them a bit easier to watch than reading the book: ▶ this video
in “Structure and Interpretation of Computer Programs (1996) [pdf]” · View on HN
As Hal Abelson said back in 1986 in the original SICP lectures [1] while drawing `(+ 3 (* 5 6) 8 2)` and the corresponding syntax tree on the board: >"We're writing these trees ... and parentheses are just a way to write this two dimensional structure as a linear character string. Of course, when LISP first started and people had teletypes or punchcards or whatever and (the parentheses character structure) was more convinient. But maybe if LISP started today the syntax would look more like (a 2D syntax tree)." [1]: ▶ this video
in “Carp lang: statically typed Lisp, no GC” · View on HN
>Maintaining tree on text editors requires careful editing and strict practices, which human brains aren't good at. The "tree" will get broken at some point, but, in this school of thought, the recovery strategy is unclear and inconsistent at best. We've had editors that automatically do that since the 70s. Here's a live demo hot from 1986: ▶ this video >The real tree, at the end of the day, is formed by line breaks and indents, not parenthesis. It isn't. You're not the type of person who lisp is for, which is fine. There are lots of languages suited for people like you. But I'd be curious to know what language you think uses nothing but line breaks and indents to describe its AST.
in “Racketscript” · View on HN
> Here's a live demo hot from 1986: ▶ this video The process in the video still perfectly aligns with my description. Actually, I reached that conclusion by observing people writing Lisp code. That is, when you're writing Lisp code, that's exactly what people next you would see, no matter what you think. Also, trailing ")"s are clearly a burden, as people do spend their brain cycles to properly match them. > It isn't. You're not the type of person who lisp is for You sound like you're right in the middle of Lisp fever, which is fine. Everyone goes through that. > But I'd be curious to know what language you think uses nothing but line breaks and indents to describe its AST. You simply didn't get what I was saying. Even when all the parens were stripped off from a Lisp code, you can easily reinsert parens based on line breaks and indents. So people rely more on indentations for correctly putting parens, rather than being cautions w/ every single editing operation.
in “Racketscript” · View on HN
Actual PDF from MIT: (I assume they’re happy to let anyone use it) [link] There’s the set of the 1986 lectures on MIT’s Open CourseWare: ▶ this video
in “Ask HN: Where to find HTML version of SICP?” · View on HN
> Written for freshman at MIT, it is ostensibly an entry-level text. But it requires such a level of competence in math and physics, and the prose itself is so dense and archaic, that I couldn't imagine suggesting it to anyone. It’s also a complement to a course, the implications here being that chapters and examples are to be discussed in class and that a certain amount of lab-work has to be performed as well for the concepts to sink-in. But It’s not for everyone. I couldn’t see a bootcamp based on this book for instance. It does assume a fair bit of math and physics knowledge (or a curiosity for such) because it was written with engineering students in mind who, for some of them, were encountering a computer for the first time of their lives. [0] > One guess is intelligence signalling. That it is human nature for a person to suggest a book in an attempt make herself look smart rather than to best assist the person asking for a suggestion. This is clickbait. SICP has been used for decades and is extremely well regarded as an introductory book. Maybe the OP lacked the fundamentals required for approaching it. If the authos has a CS degree, that reflects poorly on the program he completed. > If you love challenging books, you are neither the norm nor the audience of this post. But the MIT freshman this book was written for definitely are. [0] ▶ this video
in “How to recommend books, or, stop recommending SICP” · View on HN
> Turing Machines, on the other hand, were instantly obviously mechanizable. It was clear that one could build a physical machine to run any Turing program without human input. Harold Abelson points out in one of his lectures [0] that computer science isn't about computers any more than biology is about microscopes. From that perspective, it is clear that Turing found an existing discipline of computer science and made major contributions to it. But it doesn't really seem right to say that he invented or founded computer science. [0] ▶ this video
in “Turing Oversold?” · View on HN
The beginning of this lecture (30 seconds in) by Harold Abelson (author of SICP - Structure and Interpretation of Computer Programs) explains why Computer Science is a terrible name here. ▶ this video Not sure about the year.
in ““Computer science is not about computers”” · View on HN
Don't know if the "joke" originated with Abelson and Sussman but here's Hal Abelson talking about it: ▶ this video "It's not about computers in the same sense that physics is not really about particle accelerators." I sort of agree, but I guess it depends on what we mean about computer science being about computers. We can do things now that were downright impossible when A&S recorded their Lisp lectures simply because we can think differently about what's reasonable with regards to time and space complexity. And, of course, Abelson himself jokes about everyone wanting a faster computer in a later lecture. Perhaps we're simply confusing CS with software development, which I suppose could be likened to confusing mathematics with accounting.
in “Tribes of Programming (2017)” · View on HN
It’s funny you should ask that as I was just watching a lecture by Harold Abelson in which he addresses this exact question. ▶ this video In case you don’t have the time or inclination to watch the video it can basically be summarized by saying the following. When the Egyptians first discovered geometry it was considered crop science as it’s primary application was for determining crop yields and when to plant and harvest. In the same way now that computers science is applied to computers today. But just like Geometry is really about farming, computer science is not really about computers. Professor Abelson goes on to explain that computer science provides a means to determine proofs for abstract mathematics a reasoning, so that we can understand with definitive proof things that until now were only theoretical.
in “A curated list of Computer Engineering resources” · View on HN
That's true. The Harold Ableson GIF of him scratching out the word Science, then the word Computer comes to mind. ▶ this video
in “Stripe is down” · View on HN