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.

1,915 results for "EM effects" — page 66 of 96

B_3_12 Verified Beings & Entities

B_3_12 — Phoenix and Firebird: Resurrection Bird Across Cultures

The Phoenix — a mythical bird that dies in fire and is reborn from its own ashes — is among the most enduring and widespread symbols of death, regeneration, and immortality in world mythology. The concept appears in dist

phoenix Bennu bird Fenghuang Firebird Simurgh resurrection
B_3_01 Verified Beings & Entities

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

serpent lineage royal bloodlines Naga dynasty Pallava Nair Khmer
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_01 Verified Information & Computation

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

algorithms computation Turing machine Gödel incompleteness Church-Turing thesis
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_18 Verified Information & Computation

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

quantum error correction QEC Shor code Steane code CSS code stabilizer formalism
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_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_05 Verified Information & Computation

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

computational complexity P vs NP NP-completeness complexity classes polynomial time Turing machines
ZD_3_05 Verified Information & Computation

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

compiler parsing lexical analysis syntax analysis code generation optimization
ZD_3_15 Verified Information & Computation

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

reversible computing Landauer principle thermodynamics information erasure Szilard engine Maxwell demon
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_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_09 Verified Information & Computation

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

internet ARPANET TCP/IP World Wide Web HTTP HTML
ZD_3_12 Verified Information & Computation

ZD_3_12 — Software Engineering: Processes, Architecture, and Quality

Software engineering is the systematic application of engineering principles to the design, development, testing, deployment, and maintenance of software systems — addressing the fundamental challenge that software is am

software engineering software development agile waterfall architecture testing
ZD_5_11 Verified Information & Computation

ZD_5_11 — Version Control: Git, Distributed VCS, and Collaborative Software Development

Version control systems (VCS) are tools that track changes to files over time — enabling software developers (and increasingly writers, designers, scientists, and data analysts) to record the history of every modificatio

version control Git distributed VCS branching merging GitHub
ZD_5_02 Credible Information & Computation

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

digital preservation data longevity format obsolescence bit rot digital dark age archiving
ZD_5_17 Verified Information & Computation

ZD_5_17 — Quantum Computing: Qubits, Gates & Quantum Information Processing

Quantum computing harnesses quantum mechanical phenomena — superposition, entanglement, and interference — to perform computations fundamentally impossible for classical machines. First proposed by Richard Feynman in 198

quantum computing qubit quantum gate superposition entanglement quantum supremacy