RESEARCH BASE
Search 3,717 documents across 34 fields — every claim tier-rated by evidence
12 results for "computability"
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_2_08 — Penrose and Computation: Non-Computability, Consciousness, and Gödel's Theorem
Roger Penrose (b. 1931), Nobel laureate in physics (2020, for demonstrating that black hole formation is a robust prediction of general relativity), has advanced an influential and controversial argument that human mathe
K_1_01 — Quantum Consciousness & Penrose-Hameroff
The Orchestrated Objective Reduction (Orch-OR) theory — proposed by Nobel laureate Roger Penrose and anesthesiologist Stuart Hameroff — suggests consciousness arises from quantum computations in microtubules within neuro
K_1_12 — Orchestrated Objective Reduction: Penrose-Hameroff Theory Deep Dive
Orchestrated Objective Reduction (Orch-OR) is a theory of consciousness proposed by mathematical physicist Sir Roger Penrose (b. 1931, Nobel Prize in Physics 2020) and anesthesiologist Stuart Hameroff (b. 1947), first ar
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_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
V_1_14 — Mathematical Constants: e, φ, √2, and Beyond
Mathematical constants are fixed numerical values that arise naturally from mathematical structures — appearing independently across diverse areas from geometry and analysis to probability and physics. The most famous, $
V_4_01 — Discrete Mathematics and Logic
Discrete mathematics — the study of mathematical structures that are countable, separated, or distinct (as opposed to continuous) — provides the theoretical bedrock for computer science, digital communication, and rigoro
V_2_07 — Formal Logic: Aristotle to Turing
Formal logic — the systematic study of valid inference — spans 2,400 years from Aristotle's syllogistic (c. 350 BCE) to Turing's computation theory (1936). Aristotle's Organon established the syllogism as the fundamental
V_4_20 — Hypercomputation & Beyond-Turing Models
Hypercomputation refers to any model of computation that can solve problems beyond the theoretical capabilities of standard Turing machines — the abstract devices defined by Alan Turing in his landmark 1936 paper "On Com
BROWSE BY SECTION — 3717 documents across 34 fields