Algorithms & Computation

Watch

• What's an algorithm? - David J. Malan ↗TED-Ed
• What exactly is an algorithm? Algorithms explained | BBC Ideas ↗BBC Ideas
• But what is quantum computing? (Grover's Algorithm) ↗3Blue1Brown
• Lecture 1: Algorithmic Thinking, Peak Finding ↗MIT OpenCourseWare

Read

• Grokking Algorithms: An illustrated guide for programmers and other curious people ↗An exceptionally clear and visual primer, this book demystifies core algorithms, making complex concepts accessible to the uninitiated.Aditya Bhargava
• Algorithms ↗A comprehensive and practical textbook, offering a rigorous yet approachable treatment of fundamental algorithms and data structures essential for any serious programmer.Robert Sedgewick and Kevin Wayne
• Introduction to Algorithms ↗The definitive academic reference, this tome provides a thorough and mathematically rigorous foundation for understanding the design and analysis of algorithms.Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
• On Computable Numbers, with an Application to the Entscheidungsproblem ↗This seminal paper introduced the concept of the Turing machine, laying the theoretical bedrock for modern computation and artificial intelligence.Alan Turing
• The Complexity of Theorem-Proving ProceduresA landmark work that formally introduced the concept of NP-completeness, defining a class of problems whose efficient solution remains one of computer science's greatest challenges.Stephen A. Cook

Voices to follow

• Scott Aaronson ↗His incisive commentary and rigorous analysis illuminate the frontiers of quantum computation and the inherent limits of algorithmic power.Professor of Computer Science, University of Texas at Austin; Author and Blogger
• Cathy O'Neil ↗She critically dissects the societal impact of opaque algorithms, exposing their potential for bias and injustice in her influential work.Data Scientist, Author, and Activist
• Stuart Russell ↗A leading architect of modern artificial intelligence, he champions the development of algorithms aligned with human values, addressing the profound challenges of advanced AI.Professor of Computer Science, University of California, Berkeley; Co-author of 'Artificial Intelligence: A Modern Approach'
• Tim Roughgarden ↗His pedagogical prowess makes the intricacies of algorithm design and analysis accessible, bridging the gap between theoretical computer science and practical application.Professor of Computer Science, Columbia University; Author of 'Algorithms Illuminated' series

Glossary

• AlgorithmAn algorithm is a set of clear, step-by-step instructions for solving a problem or completing a task. It's like a recipe for a computer. For example, the steps you follow to bake a cake, from mixing ingredients to putting it in the oven, form an algorithm.
• Conditional StatementA conditional statement (often called an "if-else" statement) is an instruction that tells an algorithm to make a decision. It checks if a certain condition is true or false, and then performs different steps based on the answer. For example, "IF it is raining, THEN take an umbrella; ELSE, leave it at home."
• DebuggingDebugging is the process of finding and fixing errors or "bugs" in an algorithm or computer program. It involves carefully checking each step to see where things went wrong so the program can work correctly. For example, if your video game keeps crashing, debugging would be finding out why and fixing the problem.
• EfficiencyEfficiency refers to how well an algorithm uses resources like time and memory to complete its task. An efficient algorithm solves a problem quickly and without wasting too much computer power. For example, if you have two different ways to sort your books, the one that takes less time and effort is more efficient.
• InputInput is the information or data that you give to an algorithm or a computer program to start it working. It's what the algorithm needs to begin its task. For example, when you use a calculator, the numbers you type in are the input.
• LoopA loop is a part of an algorithm that tells it to repeat a specific set of steps multiple times until a certain condition is met. It helps avoid writing the same instructions over and over. For example, if you're asked to write your name ten times, a loop would be like saying "write your name" and then "repeat 9 more times."
• OutputOutput is the result or answer that an algorithm or computer program produces after it has finished its task. It's what you get back after the algorithm has processed the input. For example, after you type numbers into a calculator and press "=", the answer it shows is the output.
• SequenceA sequence is the specific order in which the steps of an algorithm must be followed. The order matters because doing steps out of sequence can lead to a wrong result or not completing the task. For example, when getting ready for school, you follow a sequence: wake up, brush teeth, get dressed, eat breakfast.
• StepA step is a single, specific action or instruction within an algorithm. An algorithm is made up of many individual steps that are followed in order. For example, in a recipe, "add flour" or "mix well" are individual steps.
• VariableA variable is like a named container or placeholder in an algorithm that can store a piece of information or data. The value stored in a variable can change as the algorithm runs. For example, in a game, a variable might store your "score," and that number changes as you earn points.

Threads 9

Where this connects to other fields, and why it's worth knowing.

• Logic and Valid Reasoning Philosophy

  'This sentence is false.' If it's true, it's false; if it's false, it's true. It looks like a silly word trick, but that same loop of a thing talking about itself is the exact trap that proves some problems no computer can ever solve, no matter how powerful. A brain-teaser and a hard limit on all computers turn out to be the same idea.

• Linguistics Literature

  Linguist Noam Chomsky sorted the world's grammars into a ladder, from simple to complex. Mathematicians later realized it was the very same ladder that ranks what different machines can compute. So the rules behind human sentences and the rules behind computer power turned out to be one shared theory, discovered from two totally different directions.

• Supply, Demand & Price Discovery Economics

  Figuring out how much everything in an economy should cost is a calculation too gigantic for any single computer or committee. Prices quietly solve it instead: each buyer and seller adjusts, and the whole crowd computes the answer together. That old fight over whether a government could plan an economy was really a fight about a problem too huge to compute.

• Epistemology Philosophy

  There's a proof that no computer program can ever reliably tell whether another program will run forever or eventually stop, called the halting problem. It means some things are true but no step-by-step method can ever confirm them. And since any careful 'method' of knowing is basically a procedure, the limits on computers are also limits on what anyone can ever know.

• The Scientific Method Science

  Occam's razor says the simplest explanation is usually best. Computer science makes that exact: the best theory is the shortest computer program that can spit out your data. So understanding something is really just compressing it, and 'overfitting,' a theory bloated with extra bits, is the sign you memorized instead of truly explaining.

• Procedure & Evidence Law

  Finding the culprit in a crime is brutally hard, but checking whether a given confession fits the evidence is easy. Justice quietly leans on that gap: verifying an answer is far simpler than discovering it. Computer science calls this the P-versus-NP asymmetry, the same reason we can catch fraud that we could never have predicted in advance.

• Economic Systems Economics

  Running a whole economy from the top means solving a giant math problem: who gets what, and how much. A Soviet mathematician won a Nobel treating it exactly that way. It turns out the problem is monstrously hard to compute, while markets dodge it by letting millions of people calculate at once.

• Education and Social Mobility Sociology

  Which school a kid gets into is often decided by a math recipe called the Gale-Shapley algorithm, the same one used to match people up fairly. So a big part of who climbs ahead in life is quietly handed over to a matching program.

• Computer Engineering Technology

  The cost of an algorithm becomes physical: processors, memory and data movement determine how its operations are executed.

  Sources: U.S. Bureau of Labor Statistics — Computer Hardware Engineers ↗ · ABET engineering program criteria 2025–2026 ↗