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.

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

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

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

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

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

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

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

ZD_3_00 — Systems Architecture: Subfolder Summary

ZD_3_10 — Blockchain, Cryptocurrency, and Distributed Ledger Theory

Blockchain — a distributed, append-only data structure in which records (transactions) are grouped into blocks, each block is cryptographically linked to the previous one through a hash, and the resulting chain is replic

ZD_3_08 — Cybersecurity and Network Security

Cybersecurity — the protection of computer systems, networks, and data from unauthorized access, damage, or disruption — has grown from a technical niche into a critical domain affecting national security, economic stabi