[{"data":1,"prerenderedAt":42},["ShallowReactive",2],{"subjects":3},[4,11,18,24,30,36],{"slug":5,"path":6,"title":7,"blurb":8,"description":9,"status":10},"algorithms","\u002Falgorithms","Algorithms","The classic algorithms curriculum as one coherent course — divide & conquer, sorting, data structures, sequence & string techniques, graphs, greedy, dynamic programming, backtracking, number theory, computational geometry, and intractability.","A single, rigorous pass through the classic algorithms curriculum — synthesised from CLRS, Skiena, and Erickson into one coherent sequence. Every article is written to be read closely: precise definitions, worked pseudocode in the algorithm2e style, proofs of correctness, and interactive figures and visualisers.","available",{"slug":12,"path":13,"title":14,"blurb":15,"description":16,"status":17},"theory-of-computation","\u002Ftheory-of-computation","Theory of Computation","Automata, formal languages, computability, and complexity — what can be computed, and how hard it is.","Finite automata and regular languages, context-free grammars and pushdown automata, Turing machines and decidability, and the foundations of complexity theory. Notes for this subject are coming soon.","placeholder",{"slug":19,"path":20,"title":21,"blurb":22,"description":23,"status":17},"computer-architecture","\u002Fcomputer-architecture","Computer Architecture","From logic gates to pipelines, caches, and memory hierarchies — how a machine actually runs your code.","Digital logic, instruction set architectures, the datapath and control, pipelining and hazards, the memory hierarchy and caches, and an introduction to parallelism. Notes for this subject are coming soon.",{"slug":25,"path":26,"title":27,"blurb":28,"description":29,"status":17},"physical-computing","\u002Fphysical-computing","Physical Computing","Computational methods for physical systems — simulating cloth, hair, fluids, and structures in code.","Computational methods for physical systems: discretizing continuous matter into point masses and meshes, mass-spring systems for cloth and hair, numerical integration (Euler, Verlet, implicit), the finite element method for structures, fluid simulation and the Navier–Stokes equations, and aerodynamics. Notes for this subject are coming soon.",{"slug":31,"path":32,"title":33,"blurb":34,"description":35,"status":17},"databases","\u002Fdatabases","Databases","The relational model, query languages, and what keeps data correct under concurrency and failure.","The relational model and algebra, SQL, schema design and normalization, indexing and query processing, transactions and concurrency control, recovery, and a look at distributed and NoSQL stores. Notes for this subject are coming soon.",{"slug":37,"path":38,"title":39,"blurb":40,"description":41,"status":17},"deep-learning","\u002Fdeep-learning","Deep Learning","Neural networks, gradient descent, and how machines learn patterns too subtle to program by hand.","Neurons and layers, backpropagation and gradient descent, convolutional and recurrent networks, attention and transformers, regularization, and the training tricks that make it all work. Notes for this subject are coming soon.",1781526651306]