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,110 results for "Tao Te Ching" — page 122 of 156

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_1_21 Verified Beings & Entities

B_1_21 — Culture Hero Archetype: Prometheus, Maui, Quetzalcoatl, and the Global Gift of Knowledge

The culture hero is one of the most persistent character types in world mythology — a figure (divine, semi-divine, or human) who obtains crucial knowledge, skills, or resources for humanity, often through theft from the

culture hero Prometheus Maui Quetzalcoatl fire bringer knowledge giver
B_1_07 Verified Beings & Entities

B_1_07 — Prometheus, Divine Rebellion, and Fire-Bringer Myths

The fire-bringer — a divine or semi-divine figure who steals fire, forbidden knowledge, or civilizational technology from the gods and gives it to humanity, suffering terrible punishment as a result — is one of the most

Prometheus fire-bringer divine rebellion theft of fire punishment Pandora
B_1_27 Verified Beings & Entities

B_1_27 — Muse: Inspiration Deities Across Cultures

The concept of divine inspiration — the idea that creative and intellectual achievement flows not from the individual alone but from a supernatural source that acts through the creator — is one of the most persistent ide

muse inspiration creativity divine inspiration Muses Saraswati
B_3_19 Verified Beings & Entities

B_3_19 — Mountain and Earth Spirits: Geological Guardians Across Cultures

Mountain and earth spirits — supernatural beings that inhabit, personify, or guard specific geological features — represent one of the most fundamental layers of human religious thought: the conviction that landscape is

mountain spirit earth spirit kami genius loci Apus Trolls
B_3_16 Verified Beings & Entities

B_3_16 — Yokai: Japanese Supernatural Taxonomy

Yokai (妖怪) constitute Japan's vast and systematized taxonomy of supernatural beings — a classification system unrivaled in scope by any other world mythology. Encompassing shape-shifting obake, vengeful yurei ghosts, mis

yokai obake yurei oni tengu kappa
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_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
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_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_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_18 Verified Information & Computation

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

quantum error correction QEC Shor code Steane code CSS code stabilizer formalism
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_14 Verified Information & Computation

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

type theory lambda calculus dependent types Curry-Howard Coq Lean
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