B_2_00 — Humanoid Crypto Entities: Subfolder Summary

B_1_15 — Water Deities: Poseidon, Varuna, Tlaloc, Sedna, Mazu

Water deities — gods and goddesses governing oceans, rivers, rain, lakes, and springs — rule the element most essential to life and most capable of destruction. The Greek Poseidon (lord of the sea, earthquakes, and horse

B_1_10 — Lunar Deities: Selene, Chandra, Tsukuyomi, Ix Chel, Khonsu

Lunar deities — gods and goddesses who personify, govern, or inhabit the moon — stand alongside solar deities as the most widespread divine figures in world religion, yet they carry distinct and often contrasting associa

B_1_00 — Major Deity Profiles: Subfolder Summary

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_00 — Creature Types Composite: Subfolder Summary

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

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

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_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_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_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

ZD_3_00 — Systems Architecture: Subfolder Summary