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.
3,105 results for "Te Kore" — page 122 of 156
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
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_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_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_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_5_03 — Semiotics: Signs, Symbols, and Meaning Theory
Semiotics (also semiology) — the study of signs, symbols, and meaning-making processes — is a foundational discipline that bridges linguistics, philosophy, cultural studies, communication theory, visual arts, and informa
ZD_5_02 — Digital Preservation and the Longevity of Knowledge
Digital preservation — the set of policies, strategies, and actions required to ensure continued access to digital information over time — addresses one of the great paradoxes of the information age: humanity is producin
ZD_5_14 — Data Visualization: The Science and Art of Visual Communication
Data visualization — the graphical representation of information and data — sits at the intersection of statistics, cognitive science, design, and computer science. The field's modern foundations were laid by Jacques Ber
ZD_4_15 — DNA Computing & Molecular Computation
DNA computing and molecular computation use biological molecules — primarily DNA and RNA — as substrates for information processing, storage, and logic operations. Pioneered by Leonard Adleman's 1994 demonstration of sol
ZD_4_10 — Complexity Theory in Biology — Kauffman, Wolfram, Edge of Chaos
The application of complexity theory to biology — the study of how complex, adaptive, self-organizing structures and behaviors emerge in living systems from the interactions of simpler components — has been one of the mo
ZD_4_03 — Numerical Methods and Scientific Computation: Algorithms for the Continuous World
Numerical methods are algorithms for approximately solving mathematical problems that lack closed-form analytical solutions — which is to say, most problems in science and engineering. From weather prediction to aircraft
BROWSE BY SECTION — 3,721 documents across 34 fields