B_3_08 — Garuda — Divine Eagle and Serpent Enemy

Garuda (Sanskrit: गरुड, Garuḍa) is the divine eagle of Hindu and Buddhist mythology — the king of birds, the eternal enemy of serpents (nāgas), and the mount (vāhana) of the god Viṣṇu. First attested in the Rig Veda (~15

ZD_1_12 — Information Geometry and Fisher Information

Information geometry is the mathematical field that applies differential geometry — the mathematics of curved spaces, manifolds, metrics, and connections — to the study of probability distributions and statistical models

ZD_1_08 — Lambda Calculus and Functional Programming

Lambda calculus, invented by Alonzo Church in the 1930s as a formal system for expressing computation via function abstraction and application, stands alongside Turing machines as a foundational model of computation. Chu

ZD_1_02 — Information Theory — Shannon, Entropy, and the Bit

Claude Shannon's 1948 paper "A Mathematical Theory of Communication" is one of the most consequential scientific publications of the 20th century. It defined information quantitatively — measured in bits — independent of

ZD_1_10 — Automata Theory and Formal Languages

Automata theory studies abstract computational machines and the classes of languages they recognize, forming the mathematical backbone of computer science. The Chomsky hierarchy (1956–59) classifies formal languages into

ZD_1_18 — Quantum Error Correction

Quantum error correction (QEC) protects quantum information against decoherence and operational error by encoding a single logical qubit redundantly across many physical qubits, then detecting errors via syndrome measure

ZD_1_13 — Kolmogorov Complexity and Algorithmic Information Theory

Kolmogorov complexity (also called algorithmic complexity, descriptive complexity, or program-size complexity) — the length of the shortest computer program (on a fixed universal Turing machine) that produces a given str

ZD_1_04 — Coding Theory & Error Correction

Coding theory — the mathematics of reliable communication over unreliable channels — was founded by Claude Shannon (1948), who proved the existence of channel capacity (a maximum rate at which information can be transmit

ZD_3_17 — Reversible Computing and Landauer's Principle

Landauer's principle (1961) — one of the deepest connections between physics and computation — states that the erasure of one bit of information necessarily dissipates at least $k_B T \ln 2$ of energy as heat (approximat

ZD_3_07 — Parallel Computing and GPU Programming

Parallel computing — executing multiple computations simultaneously — has become the dominant paradigm for performance growth since single-core clock speeds plateaued (~2005). Flynn's taxonomy (1966) classifies computer

ZD_5_05 — Formal Methods: Mathematical Verification and Specification of Software

Formal methods are mathematically rigorous techniques for the specification, development, and verification of software and hardware systems — using formal (mathematical) languages to describe system behavior and mathemat

ZD_5_07 — Search Algorithms: From Breadth-First to Monte Carlo Tree Search

Search algorithms are fundamental computational procedures for exploring state spaces, finding paths, locating solutions, and making decisions — they constitute one of the core pillars of computer science and artificial

ZD_5_00 — Digital Culture Tools: Subfolder Summary

ZD_4_08 — Bioinformatics and Computational Biology

Bioinformatics — the application of computational methods to biological data, especially molecular sequences — has become indispensable to modern biology. The field emerged from the convergence of molecular biology's dat

ZD_4_03 — Numerical Methods and Scientific Computation: Algorithms for the Continuous World

Numerical methods are algorithms for approximately solving mathematical problems that lack closed-form analytical solutions — which is to say, most problems in science and engineering. From weather prediction to aircraft

ZD_4_11 — Social Network Analysis — Granovetter, Small Worlds, Influence

Social network analysis (SNA) — the study of social structures through the use of graph theory and network science, where individuals (or organizations, nations, etc.) are represented as nodes and their relationships (fr

ZD_2_04 — Computer Vision and Image Processing

Computer vision — enabling machines to interpret and understand visual information from the world — has progressed from hand-crafted feature engineering to the deep learning revolution that now approaches or exceeds huma

ZD_2_16 — Federated Learning & Privacy-Preserving ML

Federated learning (FL) is a machine learning paradigm in which a model is trained across multiple decentralized devices or servers holding local data samples, without exchanging the raw data — the model comes to the dat

L_1_02 — Interbreeding Events & Genetic Discontinuities

Ancient DNA has established that late human evolution was not a simple replacement story. Expanding populations of Homo sapiens interbred with Neanderthals and Denisovans, and at least one direct first-generation hybrid

L_1_09 — Ghost Populations & Missing Archaic Lineages

Ghost populations are human groups whose existence is inferred from statistical signatures in modern or ancient genomes rather than from direct fossil or archaeological evidence. The term reflects a central challenge of