The API Economy
The economic model in which businesses expose their capabilities as programmable, often paid, web APIs so that others can build on them, turning interfaces into products.
Plain-language explanations of the ideas behind software - compilers, garbage collection, objects, types.
The economic model in which businesses expose their capabilities as programmable, often paid, web APIs so that others can build on them, turning interfaces into products.
The combinational circuit at the heart of a processor that performs arithmetic and logical operations on binary operands, the working core of the CPU datapath.
An application-specific integrated circuit: a chip custom-built for a single task, trading the flexibility of a general processor for maximum speed and energy efficiency at that one job.
The bit, short for binary digit, is the basic unit of information: a single yes or no, 0 or 1 choice, named in Shannon's 1948 paper and credited to John Tukey.
The number of people who would have to be lost before a project stalls, a blunt measure of how concentrated its critical knowledge is.
The agreed low-level rules for how functions pass arguments, return values, and preserve registers across calls; part of a platform's ABI, with the System V AMD64 convention governing most Unix-like x86-64 systems.
Europe's long-running hacker conference, held between Christmas and New Year since 1984 and organized by the Chaos Computer Club, blending technical hacking with politics, privacy, and digital rights.
The thesis that anything effectively computable can be computed by a Turing machine, equivalently by the lambda calculus - the claim that the Turing machine captures the intuitive notion of an algorithm.
The steady oscillating signal that synchronizes a synchronous digital system, marking the moments when state may change and setting the pace of computation.
Human-readable annotations in source code that the compiler ignores; their purpose is to explain why code does what it does, the danger is comment rot, and good style favors self-documenting code.
The small, fastest storage cells located inside the processor itself, holding the operands and results of computation; registers come in general-purpose, special-purpose, and flag varieties, organized into a register file.
A processor architected for the math of signal processing, with hardware multiply-accumulate and a memory layout that feeds it, exemplified by Texas Instruments' TMS320 line.
The slowdown of transistor scaling and the breakdown of Dennard scaling, which ended the era of automatic single-core speedups and pushed the industry toward multicore and specialized hardware like GPUs and TPUs.
A programming language designed to experiment with weird ideas, to be hard to program in, or as a joke, rather than for practical use, a tradition stretching from INTERCAL in 1972 through Brainfuck and Malbolge.
A list of eight false assumptions programmers new to distributed systems tend to make, which lead to designs that fail in production.
The basic one-bit memory element, built from cross-coupled gates or valves, whose two stable states let a digital circuit remember and form sequential logic.
A field-programmable gate array: an integrated circuit whose logic and interconnect can be reconfigured by the user after manufacturing, sitting between software flexibility and fixed silicon.
The set of shared principles Steven Levy articulated in his 1984 book Hackers, drawn from the MIT AI Lab: access to computers should be unlimited, information should be free, authority should be mistrusted, and people should be judged by their skill.
The proof that no general algorithm can decide, for every program and input, whether it will eventually halt or run forever - the classic example of an undecidable problem.
The fetch-decode-execute loop a processor repeats endlessly: read the next instruction from memory, interpret it, carry it out, and advance to the next.
A signal that diverts the CPU from its current work to run a handler, used by hardware to report events and by software to request services; interrupts replace wasteful polling and are dispatched through an interrupt vector table.
The JAR (Java ARchive) is a ZIP-format bundle of compiled Java classes, resources, and a manifest that serves as the unit of distribution for Java libraries and applications.
Up up down down left right left right B A: a cheat sequence left in the 1986 NES port of Gradius that escaped into the released game and became a decades-long pop-culture meme and recurring web easter egg.
The physical circuit element that implements a Boolean operation such as AND, OR, NOT, or NAND, turning the algebra of true and false into switching hardware.
Two senses share a name: an unexplained literal constant in code, treated as a code smell, and a fixed byte signature at the start of a file that identifies its format, used by the file command.
The late-1970s shift to structured, scalable chip design rules and the multi-project chip, which split chip design from fabrication and let many more people design integrated circuits.
Multiple independent CPU cores on a single die, the industry's structural answer to the end of frequency scaling, trading higher clock speeds for more parallel hardware.
Tom Cargill's rule, popularized by Jon Bentley, that the first 90 percent of the code takes 90 percent of the time and the remaining 10 percent takes the other 90 percent.
Accessing memory through a reference that points at nothing, a routine crash and security bug; option types make the absence of a value visible to the type system.
A fencepost mistake at a loop or array boundary, off by exactly one; Dijkstra argued zero-based half-open ranges make these errors less likely.
A program that takes no input and produces an exact copy of its own source code as output, a hands-on demonstration of self-reference whose existence is guaranteed by Kleene's recursion theorem and which Ken Thompson built at the heart of his Trusting Trust attack.
A bug where correctness depends on the uncontrolled timing or interleaving of concurrent operations; data races are undefined behavior in the C and C++ memory models.
The front-door documentation of a software project: a file, conventionally named in all capitals so it sorts to the top of a directory listing, that tells a visitor what the project is, why it is useful, and how to get started; on platforms like GitHub the README is rendered automatically as a repository's landing page.
A bug where a feature that used to work breaks after a later change; the reason test suites and tools like git bisect exist.
Jon Postel's rule from the early TCP/IP RFCs to be conservative in what you send and liberal in what you accept, along with the later criticism of that advice.
The two-byte magic at the start of a script, #!, that tells the kernel which interpreter should run the file.
A plain text file of shell commands run as a program, giving Unix systems automation, control flow, and the glue that ties small tools together.
An error in code that makes a program behave incorrectly; the term predates computers, and its most famous artifact is a 1947 moth taped into a Harvard logbook.
In-code markers such as TODO, FIXME, HACK, and XXX that flag deferred or suspect work; cheap to write, easy to forget, and a common way technical debt accretes inside source files.
The solid-state switching and amplifying device invented at Bell Labs in 1947 by Bardeen, Brattain, and Shockley, which replaced the vacuum tube and became the building block of all digital electronics.
The design attitude set out in the 1978 Bell System Technical Journal foreword by McIlroy, Pinson, and Tague: make each program do one thing well, and have programs cooperate by passing text streams through pipes, because text is a universal interface.
A processor whose instructions operate on whole arrays of data at once, pioneered by the Cray supercomputers and the conceptual ancestor of modern SIMD and GPU computing.
The effort to fix the Year 2000 bug was arguably the largest coordinated software-maintenance project in history: a multi-year, worldwide campaign of code inventory, COBOL date audits, field expansion or windowing, and testing, organized in industry and government through staged programs and costing on the order of hundreds of billions of dollars.
Phil Karlton's aphorism that the two hard things in computer science are cache invalidation and naming things, recorded by Martin Fowler as the primary written source.
A way of combining two changed versions of a file by comparing each against their common ancestor, so non-conflicting edits merge automatically and only true overlaps need human attention.
Local time is a moving political target: offsets and daylight saving rules change by jurisdiction and over history. The IANA Time Zone Database records these rules so software can convert correctly, and the hard-won lesson is to store instants in UTC and apply zone rules only at the edges.
A database optimized for timestamped data such as metrics and sensor readings, with fast appends, time-window queries, downsampling, and retention policies.
Letting many users share one computer interactively at the same time, instead of submitting jobs one after another in batches.