RESEARCH BASE
Search 3,721 documents across 34 fields — every claim tier-rated by evidence
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.
471 results for "site formation" — page 19 of 24
D_4_09 — Cenotes: Maya Sacred Wells, Karst Hydrology, and Underworld Cosmology
Cenotes (from Yucatec Maya dz'onot or ts'onot) are natural sinkholes formed by the dissolution and collapse of limestone bedrock in the Yucatan Peninsula, exposing the vast underground freshwater aquifer beneath. Over 6,
D_4_06 — Lascaux Cave: Paleolithic Art and Astronomical Interpretation
Lascaux Cave — located in the Vézère Valley near Montignac in the Dordogne region of southwestern France — is one of the most celebrated Paleolithic painted caves in the world. Discovered on September 12, 1940, by four t
D_4_01 — Underground Cities and Myths
Over 200 underground cities have been discovered in Cappadocia alone, with Derinkuyu extending 18 stories deep and capable of sheltering 20,000 people. Major recent discoveries include the Midyat underground city (2020),
D_4_02 — Submerged Structures & Underwater Archaeology
Since the Last Glacial Maximum (~26,500–19,000 BP), global sea levels have risen approximately 120–130 meters, inundating an estimated 25 million km² of formerly habitable land — an area larger than North America. Any co
D_4_00 — Submerged Underground: Subfolder Summary
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_00 — Foundations Theory: Subfolder Summary
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_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_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
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
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_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_11 — History of Programming Languages: From Machine Code to Modern Paradigms
The history of programming languages traces the evolution of formal notations for instructing computers — from the raw binary patterns of machine code and the mnemonic abbreviations of assembly language through the devel
ZD_3_09 — History of the Internet — From ARPANET to the Decentralized Web
The Internet — the global network of interconnected computer networks using standardized protocols to exchange data — is the most transformative communication technology since the printing press, connecting over 5 billio
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
ZD_3_01 — Database Theory and Relational Model
Database theory provides the mathematical foundations for organizing, storing, querying, and managing structured data — one of the most practically consequential branches of computer science. Before the relational model,
BROWSE BY SECTION — 3,721 documents across 34 fields