Tag
Bailey Flanigan, a shared faculty member at MIT, discusses her interdisciplinary path from medicine to public health to economics and now computational political science, focusing on democratic participation.
A software engineer reflects on designing a 54-card deck (Algodeck) that distills computer science concepts into accessible illustrations, and shares insights on how graphic design and software engineering both solve problems through systems thinking.
MIT has released the full 900-page discrete mathematics textbook 'Mathematics for Computer Science' for free online, covering proofs, graph theory, state machines, counting, recurrences, and probability as they apply to computer science.
This podcast episode discusses Peter Naur's classic paper 'Programming as Theory Building', exploring its implications for AI, LLM usage, and computer science education.
Stanford computer science professor offers a free 83-minute lecture on mastering Markov Decision Processes, covering policy evaluation, value iteration, and convergence limits.
This article announces a free online course by Tim Roughgarden that covers fundamental concepts in computer science, including Turing machines, the halting problem, algorithmic efficiency, NP-completeness, and the P vs NP problem.
Recommending the MIT classic textbook 'Mathematics for Computer Science', suitable for computer science beginners to systematically learn foundational mathematics.
An exploration of superoptimization techniques for finding the smallest possible program, reviewing related research and implementations.
This paper provides a simplified explanation of the Paxos algorithm for achieving consensus in a distributed system.
A tweet promoting the CS-Fundamentals GitHub repository that consolidates notes, cheatsheets, and interview questions for DSA, OS, DBMS, SQL, networking, OOPs, and system design to help with placement preparation.
These twenty video lectures by Hal Abelson and Gerald Jay Sussman are a complete presentation of the course Structure and Interpretation of Computer Programs, given in July 1986 for Hewlett-Packard employees and professionally produced by HP Television.
An overview of seventy years of parsing theory and its practical implications in computer science.
A software developer with 21 years of experience recounts completing a Bachelor's Degree in Computer Science entirely online via Coursera while working full-time, highlighting the flexibility and personal motivation behind the decision.
An article from 2004 explaining the difference between ABI (Application Binary Interface) and API (Application Programming Interface), likely discussing their roles in software development and compatibility.
A free open textbook 'Introduction to Theoretical Computer Science' used in Harvard courses is announced, covering foundational theory including computation, algorithms, complexity, and quantum computing.
This blog post contrasts differential calculus (analysis) as algorithmic and easy with integral calculus (synthesis) as non-algorithmic and difficult, drawing parallels to broader themes in mathematics, computer science, and AI training via automatic differentiation.
An article explaining the fundamentals of computing and software from first principles, aiming to demystify how computers work for a general audience.
A free textbook 'Mathematics for Computer Science' is available under CC BY-SA 3.0, covering key topics for computer science students.
An academic debate on whether computer science belongs to mathematics, citing a quote from computer science giant Knuth, involving discussions on discrete mathematics and the essence of algorithms.
Introduces a free small book "Virtual Memory From First Principles", focusing on explaining virtual memory principles.