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.

2,233 results for "Z boson" — page 98 of 112

D_2_02 Verified Sites & Artifacts

D_2_02 — Pompeii and Herculaneum — Frozen in Volcanic Time

The Roman cities of Pompeii (~11,000 population) and Herculaneum (~5,000 population) were destroyed and simultaneously preserved by the catastrophic eruption of Mount Vesuvius in AD 79. The eruption (now dated to October

Pompeii Herculaneum Vesuvius AD 79 eruption pyroclastic flow plaster casts
B_3_13 Verified Beings & Entities

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

sphinx Egyptian sphinx Greek sphinx Mesopotamian lamassu shedu guardian figure
ZD_1_12 Verified Information & Computation

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

information geometry Fisher information statistical manifold Riemannian geometry metric tensor natural gradient
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_02 Verified Information & Computation

ZD_1_02 — Information Theory — Shannon, Entropy, and the Bit

Claude Shannon's 1948 paper "A Mathematical Theory of Communication" is one of the most consequential scientific publications of the 20th century. It defined information quantitatively — measured in bits — independent of

information theory Claude Shannon entropy bit channel capacity noise
ZD_1_00 Information & Computation

ZD_1_00 — Foundations Theory: Subfolder Summary

ZD_1_17 Credible Information & Computation

ZD_1_17 — Integrated Information Theory

Integrated Information Theory (IIT) is a mathematical theory of consciousness developed by Giulio Tononi (University of Wisconsin-Madison, 2004; IIT 3.0, 2014; IIT 4.0, 2022) that attempts to explain what consciousness i

integrated-information-theory iit consciousness phi giulio-tononi qualia
ZD_1_10 Verified Information & Computation

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

automata theory formal languages Chomsky hierarchy finite automata pushdown automata Turing machine
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_16 Verified Information & Computation

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

quantum-information qubit quantum-entanglement quantum-error-correction quantum-computing bell-inequality
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_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_00 Information & Computation

ZD_3_00 — Systems Architecture: Subfolder Summary

ZD_3_16 Credible Information & Computation

ZD_3_16 — DNA Computing and Molecular Computation

DNA computing — the use of DNA molecules and biochemical reactions to perform computation — was inaugurated by Leonard Adleman (University of Southern California), who in 1994 demonstrated the first molecular-scale compu

dna-computing molecular-computation adleman dna-origami strand-displacement biocomputing
ZD_3_11 Verified Information & Computation

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

programming languages history FORTRAN LISP C object-oriented
ZD_3_06 Verified Information & Computation

ZD_3_06 — Internet Architecture and Protocols

The Internet — a global network of interconnected networks — is arguably the most transformative technology of the late 20th century, connecting >5 billion users worldwide. Its architecture reflects deliberate design cho

internet TCP/IP protocol packet switching ARPANET HTTP
ZD_3_17 Verified Information & Computation

ZD_3_17 — Reversible Computing and Landauer's Principle

Landauer's principle (1961) — one of the deepest connections between physics and computation — states that the erasure of one bit of information necessarily dissipates at least $k_B T \ln 2$ of energy as heat (approximat

reversible-computing landauers-principle thermodynamics-computation entropy information-erasure maxwell-demon
ZD_3_02 Verified Information & Computation

ZD_3_02 — Computer Architecture and Von Neumann Model

Computer architecture concerns the design of digital computers — the organizational structure, functional behavior, and implementation of computing systems from logic gates to complete processors. The dominant paradigm s

computer architecture von Neumann architecture stored program CPU ALU instruction set
ZD_3_04 Verified Information & Computation

ZD_3_04 — Operating Systems and Concurrency

Operating systems (OS) — the software layer managing hardware resources and providing abstractions for applications — are among the most complex software artifacts ever built. They manage process scheduling (deciding whi

operating system process management concurrency thread mutex semaphore