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,719 results for "C symmetry" — page 103 of 186

B_1_20 Credible Beings & Entities

B_1_20 — Trickster Deities: Cross-Cultural Comparison

The trickster is among the most widespread deity archetypes in world mythology, appearing independently across every inhabited continent. Characterized by cunning, boundary-crossing, shapeshifting, and the subversion of

trickster-deity loki anansi coyote hermes sun-wukong
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_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_14 Verified Beings & Entities

B_3_14 — Four Horsemen and Apocalyptic Entities: End-Time Beings

Apocalyptic entities — supernatural beings associated with the end of the world, the Last Judgment, and the cosmic battle between good and evil — populate the eschatological traditions of virtually every major religion.

Four Horsemen Apocalypse Revelation eschatology end-times Antichrist
B_3_12 Verified Beings & Entities

B_3_12 — Phoenix and Firebird: Resurrection Bird Across Cultures

The Phoenix — a mythical bird that dies in fire and is reborn from its own ashes — is among the most enduring and widespread symbols of death, regeneration, and immortality in world mythology. The concept appears in dist

phoenix Bennu bird Fenghuang Firebird Simurgh resurrection
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_01 Verified Beings & Entities

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

serpent lineage royal bloodlines Naga dynasty Pallava Nair Khmer
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_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_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_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_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
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_05 Verified Information & Computation

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

compiler parsing lexical analysis syntax analysis code generation optimization
ZD_3_15 Verified Information & Computation

ZD_3_15 — Reversible Computing: Landauer's Principle and the Thermodynamics of Computation

Reversible computing — the theory and practice of performing computation without irreversible information loss — sits at the intersection of computer science, thermodynamics, and information theory, centered on the profo

reversible computing Landauer principle thermodynamics information erasure Szilard engine Maxwell demon