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,695 results for "de natura deorum" — page 96 of 135
B_3_03 — Mami Wata and Pan-African Water Spirit Traditions
This document examines Mami Wata and Pan-African Water Spirit Traditions, a topic within the Beings and Entities research area. Key areas of investigation include Overview of the Tradition, Etymology and Naming, Visual I
B_3_07 — Typhon — Greek Chaos Monster
Typhon (Greek: Τυφών/Τυφωεύς) is the most terrible monster in Greek mythology — a gigantic, multi-headed, fire-breathing serpentine creature born from Gaia (Earth) and Tartarus as the final challenge to Zeus's cosmic sov
B_3_02 — Wadjet (Wadjyt) and Uraeus: Egyptian Cobra Protector
Wadjet is a core Egyptian cobra goddess tied to Lower Egypt and royal protection. The Uraeus motif (rearing cobra on royal regalia) represents her power, paired with Nekhbet as the "Two Ladies" of unified kingship. Evide
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_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_01 — Algorithms, Computation, and the Limits of Knowledge
An algorithm is a finite, unambiguous sequence of instructions for solving a problem — a concept formalized independently by Alan Turing (Turing machine, 1936) and Alonzo Church (lambda calculus) in response to David Hil
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_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_15 — Quantum Information Theory: Entanglement, Quantum Computing, and Information Bounds
Quantum information theory — the study of how information is encoded, processed, communicated, and protected using quantum mechanical systems — represents one of the most transformative intellectual developments at the i
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_16 — Quantum Information Theory
Quantum information theory — the study of how information is encoded, processed, and transmitted using quantum mechanical systems — has emerged as one of the most transformative research fields of the 21st century, unify
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_03 — Information as Fundamental Reality
Multiple converging lines of evidence suggest information, not matter or energy, may be the most fundamental constituent of reality. From Wheeler's "It from Bit" to the holographic principle (3D reality encoded on 2D bou
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_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_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_05 — Compiler Theory and Parsing
Compiler theory — the science of translating high-level programming languages into machine-executable code — is one of the most mathematically rigorous and practically impactful subfields of computer science. Compilers b
BROWSE BY SECTION — 3721 documents across 34 fields