Curiosity Cabinet / CS As Art
Computer Science As Art
A personal note for artists and curious people: algorithms, proofs, compilers, distributed systems, and type systems can be beautiful in their own medium.
Post
Reading note.
A note on the beauty of computer science ideas, written for people who think art only lives in paintings or songs.
How to read this
Personal writing is labelled personal; external claims, quotes, and media require source context.
The Claim
Some art moves through sound, paint, rhythm, or story. Some beauty in computer science moves through compression: a small idea suddenly explains a large class of things.
A good proof can feel like a door opening. A good abstraction can feel like a room getting cleaned in one sentence.
- invariants
- recursion
- compilers
- distributed consensus
- types
- compression
- proof
Starter Gallery
Good starter exhibits: Euclid's proof of infinite primes, Godel's self-reference, Cantor's diagonal argument, Dijkstra's shortest path, Paxos as institutional anxiety, and a parser turning text into structure.
Each exhibit needs a plain explanation, one diagram, one reason it is useful, and one reason it feels beautiful.