A card from a free library — ask anything, no account, works offline. Every card carries its source.
Computer science — bits, logic, and what can be computed
computer science
Information is bits (a byte is 2^8 = 256 values); logic gates build from the 16 Boolean functions of two inputs; good algorithms beat bad ones (merge sort's n log n against n^2); and computability and complexity say what a machine can do at all and how fast (the halting problem undecidable; P vs NP open). Four pillars rest on the instruments (information, logic), P vs NP (complexity), and the mind (which computes). The engine is itself one such machine. The stick (stick_computer_science_bits_logic_and_what_can_be_computed) seals the byte, the Boolean-gate count and the merge-sort comparisons (tools/seed_computer_science.py).
- has part → Information is bits — the byte — a pillar of computer science (Information is bits)
- has part → Logic gates — the 16 functions of two inputs — a pillar of computer science (Logic gates)
- has part → Algorithms — good beats bad — a pillar of computer science (Algorithms)
- has part → Computability and complexity — Turing to P vs NP — a pillar of computer science (Computability and complexity)
- part of → The Floor of Discovery — one floor, and by its design the fear of God — computation on the one map
Is this card incomplete? Tell the library — it will call out for more ↗