RESEARCH BASE
Search 3,721 documents across 34 fields — every claim tier-rated by evidence
3,633 are the core, quality-scored corpus (34 lettered sections — see How We Work); the remaining 88 are cross-corpus synthesis documents (68 InterDocs, 12 Connections, 8 Theories) also indexed here.
2,945 results for "As Above So Below" — page 119 of 148
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_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_07 — Cellular Automata and Rule Systems: Emergence from Simple Rules
Cellular automata (CA) are discrete computational systems where simple local rules applied to a grid of cells generate complex global behavior — demonstrating that complexity can emerge from simplicity without central co
ZD_1_14 — Type Theory: Lambda Calculus, Dependent Types, and the Curry-Howard Correspondence
Type theory is a foundational framework in mathematics, logic, and computer science that classifies values and expressions into types — categories that determine what operations are valid: a natural number can be added t
ZD_1_05 — Computational Complexity: P vs NP and the Limits of Efficient Computation
Computational complexity theory classifies problems not by whether they can be solved, but by how efficiently they can be solved — and its central open question, P vs NP, is one of the seven Clay Millennium Prize Problem
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_15 — Reversible Computing: Landauer's Principle and the Thermodynamics of Computation
Reversible computing — the theory and practice of performing computation without irreversible information loss — sits at the intersection of computer science, thermodynamics, and information theory, centered on the profo
ZD_3_10 — Blockchain, Cryptocurrency, and Distributed Ledger Theory
Blockchain — a distributed, append-only data structure in which records (transactions) are grouped into blocks, each block is cryptographically linked to the previous one through a hash, and the resulting chain is replic
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_02 — Computer Architecture and Von Neumann Model
Computer architecture concerns the design of digital computers — the organizational structure, functional behavior, and implementation of computing systems from logic gates to complete processors. The dominant paradigm s
ZD_3_09 — History of the Internet — From ARPANET to the Decentralized Web
The Internet — the global network of interconnected computer networks using standardized protocols to exchange data — is the most transformative communication technology since the printing press, connecting over 5 billio
ZD_3_19 — Quantum Internet
The quantum internet — a network that transmits quantum information (qubits) between distant nodes using the principles of quantum mechanics, particularly entanglement and superposition — represents one of the most ambit
ZD_3_20 — Edge Computing
Edge computing is a distributed computing paradigm that brings computation and data storage closer to the sources of data — at or near the "edge" of the network — rather than relying on a centralized data center. The con
ZD_5_02 — Digital Preservation and the Longevity of Knowledge
Digital preservation — the set of policies, strategies, and actions required to ensure continued access to digital information over time — addresses one of the great paradoxes of the information age: humanity is producin
ZD_5_12 — Edge AI and TinyML: On-Device Machine Learning and Embedded Intelligence
Edge AI is the deployment of artificial intelligence algorithms on devices at the "edge" of the network — smartphones, embedded systems, cameras, sensors, wearables, industrial controllers, autonomous vehicles, and drone
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_01 — Graph Theory and Algorithms
Graph theory — the mathematical study of graphs (networks of vertices/nodes connected by edges/links) — is one of the most widely applicable branches of mathematics, modeling everything from social networks and transport
BROWSE BY SECTION — 3,721 documents across 34 fields