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,397 results for "System 1" — page 88 of 120

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_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_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_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_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_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_18 Credible Information & Computation

ZD_3_18 — Optical Computing: Photonic Processors, All-Optical Logic & Speed-of-Light Computation

Optical computing — the use of photons instead of electrons to perform computation — has been pursued since the 1960s as a means to overcome the fundamental speed, bandwidth, and energy limitations of electronic processo

optical-computing photonic-processor silicon-photonics all-optical-logic mach-zehnder optical-neural-network
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_3_19 Credible Information & Computation

ZD_3_19 — Quantum Internet

The quantum internet — a network that transmits quantum information (qubits) between distant nodes using the principles of quantum mechanics, particularly entanglement and superposition — represents one of the most ambit

quantum internet quantum networking entanglement distribution quantum key distribution QKD quantum repeaters
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_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
ZD_5_10 Verified Information & Computation

ZD_5_10 — Information Retrieval: Search Engines, Ranking, and Vector Search

Information retrieval (IR) is the science of searching for information in a collection of documents, metadata, databases, or the World Wide Web — finding material (usually text documents) of an unstructured nature (usual

information retrieval search engine TF-IDF PageRank relevance ranking NLP
ZD_5_01 Verified Information & Computation

ZD_5_01 — Graph Theory and Algorithms

Graph theory — the mathematical study of graphs (networks of vertices/nodes connected by edges/links) — is one of the most widely applicable branches of mathematics, modeling everything from social networks and transport

graph theory graph algorithm shortest path network flow Euler path Dijkstra
ZD_5_13 Verified Information & Computation

ZD_5_13 — Digital Forensics: Computer Evidence, Incident Response, and Cyber Investigation

Digital forensics is the application of scientific methods and techniques to the identification, collection, preservation, examination, analysis, and presentation of digital evidence from computers, networks, mobile devi

digital forensics computer forensics evidence acquisition chain of custody malware analysis incident response
ZD_5_15 Credible Information & Computation

ZD_5_15 — Information & Hybrid Warfare

Information warfare and hybrid warfare describe the integration of military and non-military tools — cyberattacks, disinformation campaigns, economic coercion, proxy forces, diplomatic pressure, and conventional military

information warfare hybrid warfare Gerasimov doctrine cyber operations psychological operations propaganda
ZD_5_14 Verified Information & Computation

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

data visualization Edward Tufte visual analytics information design statistical graphics dashboard design
ZD_4_12 Verified Information & Computation

ZD_4_12 — Quantum Computing — Architecture, Algorithms, and Implications

Quantum computing — computation that exploits the principles of quantum mechanics (superposition, entanglement, and interference) to process information in ways fundamentally different from classical computers — represen

quantum computing qubit superposition entanglement quantum gate Shor algorithm
ZD_4_15 Credible Information & Computation

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

DNA computing molecular computation Adleman DNA strand displacement DNA origami biocomputing