RESEARCH BASE

Search 3,721 documents across 34 fields — every claim tier-rated by evidence

3,721 Documents 34 Sections 43,625 Citations 34,852 Keywords Indexed 4 Evidence Tiers

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.

692 results for "Pont du Gard" — page 24 of 35

B_1_03 Verified Beings & Entities

B_1_03 — Osiris — Death, Resurrection, and the Underworld Kingdom

Osiris (Egyptian: Wsjr, conventionally vocalized as Wesir/Usir) is one of the most important deities of ancient Egypt — the god who rules the underworld (Duat), judges the dead, and provides the template for resurrection

Osiris Wesir Usir death and resurrection underworld Duat
B_1_04 Verified Beings & Entities

B_1_04 — Ningishzida — Serpent Deity, Underworld Guardian, and Knowledge Bearer

Ningishzida (Sumerian: dNin-ĝiš-zid-da, "Lord of the Good Tree" or "Lord of the Faithful Tree") is a Mesopotamian deity associated with serpents, the underworld, vegetation, and secret knowledge. He appears in Sumerian t

Ningishzida Gizzida serpent deity underworld guardian Sumerian Mesopotamian
B_3_04 Verified Beings & Entities

B_3_04 — Chimeric Beings — Centaurs, Sphinxes, Minotaurs, and Composite Entities

Composite beings — entities combining human and animal features — appear in the art and mythology of every major civilization. From the Egyptian Sphinx and Mesopotamian Lamassu to the Greek Centaur, Hindu Garuda, and Mes

chimera centaur sphinx minotaur manticore Garuda
B_3_10 Verified Beings & Entities

B_3_10 — World Tree Guardians and Cosmic Serpents

The World Tree — a colossal tree (or pillar, mountain, or vine) connecting the layers of the cosmos (typically underworld, earth, and heavens) — is one of the most widespread cosmological concepts in human mythology, app

world tree axis mundi Yggdrasil Níðhöggr Jörmungandr cosmic serpent
B_3_17 Credible Beings & Entities

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

Nāga serpent kings Nāga Buddhism Mucalinda Ananta Shesha Nāgarāja
B_3_05 Verified Beings & Entities

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

Thunderbird Garuda Simurgh Phoenix Bennu Fenghuang
B_3_11 Verified Beings & Entities

B_3_11 — Kitsune, Huli Jing, and Fox Spirits in East Asian Tradition

Fox spirits — beings that have cultivated supernatural powers through longevity, meditation, or absorbing celestial energy — represent one of the most richly developed and culturally significant categories of supernatura

kitsune fox spirit huli jing kumiho nine-tailed fox shapeshifting
B_3_13 Verified Beings & Entities

B_3_13 — Sphinx Entities: Guardian Riddle-Keepers Beyond Giza

The Sphinx — a composite creature with a lion's body and a human (or divine) head — appears as a guardian being across multiple civilizations of the ancient world, functioning as a liminal protector stationed at threshol

sphinx Egyptian sphinx Greek sphinx Mesopotamian lamassu shedu guardian figure
B_3_08 Verified Beings & Entities

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

Garuda Garuḍa eagle bird serpent enemy nāga
ZD_1_12 Verified Information & Computation

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

information geometry Fisher information statistical manifold Riemannian geometry metric tensor natural gradient
ZD_1_08 Verified Information & Computation

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

lambda calculus functional programming Church Turing computability Church-Turing thesis
ZD_1_02 Verified Information & Computation

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

information theory Claude Shannon entropy bit channel capacity noise
ZD_1_13 Verified Information & Computation

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

Kolmogorov complexity algorithmic information theory algorithmic randomness incompressibility minimal description length Solomonoff
ZD_1_09 Verified Information & Computation

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

Game of Life cellular automata Conway recreational information-computation emergence self-replication
ZD_1_11 Verified Information & Computation

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

Turing machine computability decidability halting problem Church-Turing thesis algorithm
ZD_1_05 Verified Information & Computation

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

computational complexity P vs NP NP-completeness complexity classes polynomial time Turing machines
ZD_1_04 Verified Information & Computation

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

coding theory error correction Shannon Hamming code Reed-Solomon information theory
ZD_3_04 Verified Information & Computation

ZD_3_04 — Operating Systems and Concurrency

Operating systems (OS) — the software layer managing hardware resources and providing abstractions for applications — are among the most complex software artifacts ever built. They manage process scheduling (deciding whi

operating system process management concurrency thread mutex semaphore
ZD_3_07 Verified Information & Computation

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

parallel computing GPU GPGPU CUDA multicore thread parallelism
ZD_5_17 Verified Information & Computation

ZD_5_17 — Quantum Computing: Qubits, Gates & Quantum Information Processing

Quantum computing harnesses quantum mechanical phenomena — superposition, entanglement, and interference — to perform computations fundamentally impossible for classical machines. First proposed by Richard Feynman in 198

quantum computing qubit quantum gate superposition entanglement quantum supremacy