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.

3,697 results for "Enclosure D" — page 126 of 185

B_1_01 Credible Beings & Entities

B_1_01 — Angels, Celestial Hierarchies, and Messenger Beings

Angels (from Greek angelos = "messenger," translating Hebrew mal'akh) appear in virtually every religious tradition — intermediary beings between the divine and human realms who carry messages, enforce divine will, guard

angels celestial hierarchy Pseudo-Dionysius nine orders seraphim cherubim
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_02 Verified Beings & Entities

B_1_02 — Thoth — Egyptian God of Writing, Wisdom, and Cosmic Order

Thoth (Egyptian: Ḏḥwty, conventionally vocalized as Djehuty) is the Egyptian deity of writing, wisdom, measurement, the moon, magic, and cosmic order — the divine scribe who records the judgment of the dead, invents hier

Thoth Djehuty Hermes Trismegistus ibis baboon Egyptian wisdom deity
B_1_05 Verified Beings & Entities

B_1_05 — Metatron — The Angelic Scribe and Divine Mediator

Metatron is the highest-ranking angel in Jewish mystical tradition — variously called the "Prince of the Countenance" (sar ha-panim), the "Lesser YHWH" (YHWH ha-qatan), and the heavenly scribe who records the deeds of Is

Metatron angel scribe Enoch 3 Enoch Sefer Hekhalot
B_3_18 Credible Beings & Entities

B_3_18 — Bull and Auroch Symbolic Typology: From Cave Art to Modern Mythology

The bull/auroch represents one of humanity's most enduring symbolic animals, appearing in cave paintings at Lascaux (c. 17,000 BCE) and Chauvet (c. 36,000 BCE), at the proto-urban sanctuary of Çatalhöyük (c. 7500–5700 BC

bull-auroch-typology minotaur apis nandi aurochs-cave-art bull-leaping
B_3_02 Verified Beings & Entities

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

Wadjet Wadjyt Uto Buto Per-Wadjet Uraeus
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
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_01 Verified Information & Computation

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

algorithms computation Turing machine Gödel incompleteness Church-Turing thesis
ZD_1_06 Verified Information & Computation

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

Boolean algebra logic gates AND OR NOT NAND
ZD_1_10 Verified Information & Computation

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

automata theory formal languages Chomsky hierarchy finite automata pushdown automata Turing machine
ZD_1_15 Verified Information & Computation

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

quantum information qubit entanglement quantum computing quantum error correction Shor algorithm
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_16 Verified Information & Computation

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

quantum-information qubit quantum-entanglement quantum-error-correction quantum-computing bell-inequality
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_07 Verified Information & Computation

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

cellular automata Conway's Game of Life Stephen Wolfram Rule 110 emergence self-organization
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