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.
123 results for "computation universality" — page 6 of 7
ZD_4_06 — Mathematical Sociology and Network Analysis
Mathematical sociology applies formal mathematical models — graph theory, probability, game theory, dynamical systems, and statistical mechanics — to understand social structures, collective behavior, and institutional d
ZD_4_11 — Social Network Analysis — Granovetter, Small Worlds, Influence
Social network analysis (SNA) — the study of social structures through the use of graph theory and network science, where individuals (or organizations, nations, etc.) are represented as nodes and their relationships (fr
ZD_4_00 — Applied Interdisciplinary: Subfolder Summary
ZD_2_15 — Transformer Architecture: Self-Attention and the Foundation of Modern AI
The transformer is a neural network architecture introduced in 2017 that replaced recurrent and convolutional models as the dominant paradigm in artificial intelligence. Its core innovation — the self-attention mechanism
ZD_2_07 — Artificial General Intelligence — Architectures and Challenges
Artificial General Intelligence (AGI) — a hypothetical AI system capable of performing any intellectual task that a human can, with the same flexibility, generality, and ability to learn and transfer knowledge across dom
ZD_2_12 — Generative AI: Large Language Models, Diffusion, and the Transformer Revolution
Generative AI refers to artificial intelligence systems capable of creating new content — text, images, audio, video, code, 3D models — that is novel, coherent, and often indistinguishable from human-created work. The fi
ZD_2_10 — Speech Recognition and Synthesis: From Acoustic Models to Neural Voice Generation
Speech recognition (Automatic Speech Recognition — ASR) and speech synthesis (Text-to-Speech — TTS) are complementary technologies that bridge human spoken language and machine processing. ASR converts spoken audio into
ZD_2_01 — Machine Learning Mathematics
Machine learning — the science of algorithms that improve through experience — rests on a rich mathematical foundation spanning optimization, statistics, linear algebra, probability, and functional analysis. The core mat
ZD_2_14 — Autonomous Systems: Self-Driving Vehicles, Drones, and Safety-Critical AI
Autonomous systems are machines capable of performing complex tasks in unstructured, dynamic environments with limited or no human intervention — perceiving their environment through sensors, making decisions through com
ZD_2_00 — AI Machine Learning: Subfolder Summary
ZD_2_13 — Explainable AI: Interpretability, Trust, and the Black Box Problem
Explainable AI (XAI) is the field concerned with making artificial intelligence systems — particularly complex machine learning models — understandable to humans. As AI systems increasingly make or influence high-stakes
ZD_2_09 — Recommender Systems: Collaborative Filtering, Content-Based, and Hybrid Approaches
Recommender systems (RecSys) are algorithms and architectures that predict user preferences and suggest relevant items — products, movies, music, news articles, social media posts, job listings, potential partners — from
ZD_2_11 — Reinforcement Learning: Agents, Rewards, and Sequential Decision-Making
Reinforcement learning (RL) is a paradigm of machine learning in which an agent learns to make sequential decisions by interacting with an environment, receiving rewards (or penalties) for its actions, and adjusting its
ZA_3_12 — Lattice Gauge Theory and Non-Perturbative QCD
Lattice gauge theory — the formulation of quantum field theories on a discrete spacetime lattice rather than in continuous spacetime — is the only known first-principles method for making non-perturbative calculations in
V_4_09 — Numerical Analysis: Algorithms for Approximate Solutions
Numerical analysis — the study of algorithms for approximately solving mathematical problems that cannot be solved exactly (or cannot be solved exactly in practice due to computational constraints) — is the mathematical
V_4_18 — Information Theory Cross-Discipline Bridge
Information theory, founded by Claude Shannon in 1948, provides a universal mathematical framework for quantifying uncertainty, communication capacity, and data compression. Its core concepts — entropy, mutual informatio
V_4_21 — Cryptography & Mathematical Foundations
Cryptography — the science of secure communication — rests on some of the deepest results in number theory, algebra, and computational complexity. Modern public-key cryptography was born in 1976 when Whitfield Diffie and
V_4_27 — Bayesian Inference: Probabilistic Reasoning from Bayes to Machine Learning
Bayesian inference — the mathematical framework for updating beliefs in light of evidence — has become the dominant paradigm in statistics, machine learning, cognitive science, and philosophy of science. Named after Reve
V_4_28 — Game Theory: Strategic Decision-Making and Evolutionary Dynamics
Game theory — the mathematical study of strategic interaction among rational agents — was formalized by John von Neumann and Oskar Morgenstern in Theory of Games and Economic Behavior (1944) and transformed by John Nash'
V_4_17 — Quantum Computing Algorithms: From Shor's Factoring to Variational Quantum Eigensolvers
Quantum computing exploits the principles of quantum superposition, entanglement, and interference to perform computations that are intractable for classical computers. The field was conceptually launched by Richard Feyn
BROWSE BY SECTION — 3,721 documents across 34 fields