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,646 results for "SI second" — page 96 of 133
B_3_17 — Nāga Kings: Serpent Deities in Buddhist, Hindu, and Southeast Asian Tradition
The Nāga (Sanskrit: नाग) — divine serpent beings with the power to assume human, serpentine, or hybrid forms — constitute one of the most pervasive and enduring supernatural categories across South and Southeast Asian re
B_3_01 — Dynastic Serpent Lineage Claims
Across every inhabited continent except Australia, royal houses claimed literal genealogical descent from serpent, dragon, or reptilian beings. These were not metaphors — they were formal genealogical claims inscribed in
B_3_05 — Thunderbird and Avian Supernatural Beings
Supernatural avian beings — enormous, powerful, and frequently storm-associated birds — form one of the most persistent and geographically widespread motifs in world mythology. From the Thunderbird of North American Plai
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_06 — Boolean Algebra and Logic Gates: The Mathematics of Digital Systems
Boolean algebra, formalized by George Boole in 1854, reduces logical reasoning to algebraic manipulation of binary values (TRUE/FALSE, 1/0). This seemingly simple mathematical system became the foundation of the entire d
ZD_1_17 — Integrated Information Theory
Integrated Information Theory (IIT) is a mathematical theory of consciousness developed by Giulio Tononi (University of Wisconsin-Madison, 2004; IIT 3.0, 2014; IIT 4.0, 2022) that attempts to explain what consciousness i
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_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_09 — Conway's Game of Life and Recreational Mathematics
Conway's Game of Life (1970), a two-dimensional cellular automaton devised by mathematician John Horton Conway (1937–2020), stands as perhaps the most famous example of how astonishingly complex behavior can arise from e
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_11 — Turing Machine, Computability, and the Limits of Computation
The Turing machine — a mathematical model of computation defined by Alan Turing in his 1936 paper "On Computable Numbers, with an Application to the Entscheidungsproblem" — is the foundational formalism of theoretical co
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_3_06 — Internet Architecture and Protocols
The Internet — a global network of interconnected networks — is arguably the most transformative technology of the late 20th century, connecting >5 billion users worldwide. Its architecture reflects deliberate design cho
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_08 — Cybersecurity and Network Security
Cybersecurity — the protection of computer systems, networks, and data from unauthorized access, damage, or disruption — has grown from a technical niche into a critical domain affecting national security, economic stabi
ZD_3_18 — Optical Computing: Photonic Processors, All-Optical Logic & Speed-of-Light Computation
Optical computing — the use of photons instead of electrons to perform computation — has been pursued since the 1960s as a means to overcome the fundamental speed, bandwidth, and energy limitations of electronic processo
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_3_12 — Software Engineering: Processes, Architecture, and Quality
Software engineering is the systematic application of engineering principles to the design, development, testing, deployment, and maintenance of software systems — addressing the fundamental challenge that software is am
BROWSE BY SECTION — 3,721 documents across 34 fields