On Computable Numbers, with an Application to the Entscheidungsproblem

1937/01/01 by A. M. Turing, Alan Turing · 1 voice · 8,111 citations
Computer Science · Mathematics · #Algorithm #Citation #Computability, Logic, AI Algorithms #Computer science #Information retrieval #Library science #Logic, Reasoning, and Knowledge #Mathematics #Programming language #Turing #Turing machine

paper · doi:10.1112/plms/s2-42.1.230

published in Proceedings of the London Mathematical Society s2-42(1), 230-265 (Wiley)

openalex publication_date 1937/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Citations

• An Unsolvable Problem of Elementary Number Theory

Cited by

• I.—COMPUTING MACHINERY AND INTELLIGENCE
• What is computation?
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Von Menschen und Maschinen: Psychologiehistorische Reflexionen über Künstliche Intelligenz
• Design and Construction of a Brain-Like Computer: A New Class of Frequency-Fractal Computing Using Wireless Communication in a Supramolecular Organic, Inorganic System
• The influence of domain interpretations on computational models
• Machine, organism and language: a comparative epistemology of AI models
• The Halting Paradox
• Libertarian free will and quantum indeterminism
• Information theory, predictability, and the emergence of complex life
• Can we express every transfinite concept constructively?
• On the Church-Turing thesis
• Towards a Neural Model for Serial Order in Frontal Cortex: a Brain Theory from Memory Development to Higher-Level Cognition
• Is a deterministic universe logically consistent with a probabilistic Quantum Theory?
• Artificial Consciousness and Security
• The world of strategies with memory
• Computable structures on topological manifolds
• There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: P \not= NP
• On Polynomial Time Computable Numbers
• Machines, Logic and Quantum Physics
• Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine
• The Tractable Cognition Thesis
• Halfway Up To the Mathematical Infinity: On the Ontological and Epistemic Sustainability of Georg Cantor's Transfinite Design
• Interface agents: A review of the field
• Computable g- Frames
• Typologies of Computation and Computational Models
• Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value
• Autism, epistemic injustice, and epistemic disablement: a relational account of epistemic agency
• A clear case for scientific progress at the origin of analytic philosophy
• Impossibility Results in AI: A Survey
• Quantum Computing: Lecture Notes
• On Learning to Think: Algorithmic Information Theory for Novel\n Combinations of Reinforcement Learning Controllers and Recurrent Neural World\n Models
• Kolmogorov Complexity and Information Content
• The risk of divergence
• Deep Learning in Neural Networks: An Overview
• Towards a Church-Turing-Thesis for Infinitary Computations
• Nature of codes and codes of nature: A short excursion into the past and the future of the biological codes
• The Machine as Data: A Computational View of Emergence and Definability
• A Short Introduction to Model Selection, Kolmogorov Complexity and Minimum Description Length (MDL)
• Mental programming of spatial sequences in working memory in the macaque frontal cortex
• The prehistory of generative grammar and Chomsky’s debt to Emil Post
• The Turing machine of a harmonic oscillator: from the code to the dynamic system
• Artificial Life Meets Computational Creativity?
• Haptic Assembly and Prototyping: An Expository Review
• Measuring Machine Companionship: Scale Development and Validation for AI Companions
• Ethical Artificial Intelligence
• Observations on the Halting Problem
• Deep Learning Works in Practice. But Does it Work in Theory?
• Formalizing common sense for scalable inconsistency-robust information integration using Direct Logic(TM) reasoning and the Actor Model
• A Framework for Algebraic Characterizations in Recursive Analysis
• Burning Geometric Graphs
• On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
• Risks of abuse of large language models, like ChatGPT, in scientific publishing: Authorship, predatory publishing, and paper mills
• Generating Asymptotically Non-Terminating Initial Values for Linear Programs
• Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
• Can Turing machines capture everything we can compute?
• On Programs and Genomes
• Engineering a cognition-based specification method
• Un énoncé et un texte inaugural
• Complex Networks from Simple Rewrite Systems
• Extended Models of Finite Automata
• Modeling the Mutation and Competition of Certain Nutrient-Producing Protocells by Means of Specific Turing Machines
• Lifting countable to uncountable mathematics
• On The Dynamical Nature Of Computation
• Simplification and integration in computing and cognition: the SP theory and the multiple alignment concept
• Veridical Data Science
• On the algorithmic descriptive complexity of attractors in topological dynamics
• Technoliberalism and the Network Social
• The complexity of small universal Turing machines: a survey
• Gaussian Attention Model and Its Application to Knowledge Base Embedding and Question Answering
• On consistency and existence in mathematics
• A nondeterministic Turing machine variant to compute functions
• Rebooting Neuromorphic Hardware Design -- A Complexity Engineering Approach
• One Big Net For Everything
• A thorough introduction to non-relativistic matrix mechanics in multi-qudit systems with a study on quantum entanglement and quantum quantifiers
• A case for weakening the Church-Turing Thesis
• Thoughts on Computational Creativity
• Long multiplication by instruction sequences with backward jump instructions
• A pumping lemma for non-cooperative self-assembly
• Computing as compression: the SP theory of intelligence
• The Relativity of Induction
• Neurocoder: Learning General-Purpose Computation Using Stored Neural Programs
• Speculative machines and us: more-than-human intuition and the algorithmic condition
• Most tensor problems are NP-hard
• Culture, Computation, Morality
• Implementing distributed λ-calculus interpreter
• Translational tilings: structured or wild?
• Computable analysis on the space of marked groups
• Open Quantum Systems and Quantum Algorithms
• An infinite version of arrow's theorem in the effective setting
• The Story of Telebrain: A multi-performer telematic platform for performatization
• Zeno machines and Running Turing machine for infinite time
• On the basis of brain: neural-network-inspired changes in general-purpose chips
• Between order and chaos
• Intractability and the use of heuristics in psychological explanations
• Complex Dynamical Systems
• Information processing pathway maps — A scalable framework for mapping cortical processing
• Epistemic Horizons: This Sentence is (1)/(√(2))(|True⟩ + |False⟩)
• What Is Working Memory and Mental Imagery? A Robot that Learns to Perform Mental Computations
• Universal Computation Is 'Almost Surely' Chaotic
• Epimenides, Gödel, Turing: an Eternal Gölden Tangle
• The Fundamental Theorem of Algebra made effective: an elementary real-algebraic proof via Sturm chains
• Is there a "loophole" in Goedel's interpretation of his formal reasoning and its consequences?
• Epistemic Phase Transitions in Mathematical Proofs
• On Arithmetic Modular Categories
• A Lambda Calculus for Quantum Computation
• On the proper treatment of connectionism
• On computable abstractions (a conceptual introduction)
• The reverse mathematics of Cousin's lemma
• On the uncountability of ℝ
• A synthesis and a practical approach to complex systems
• Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons
• Confusion in the Church-Turing Thesis
• Introduction to Quantum Algorithms
• The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities
• The formal roots of Platonism
• A spiking neural algorithm for the Network Flow problem
• Forecast and event control: On what is and what cannot be possible
• Rate Distortion and Denoising of Individual Data Using Kolmogorov complexity
• Turing Patterns with Turing Machines: Emergence and Low-level Structure Formation
• Local Hamiltonians in Quantum Computation
• Reactive Turing Machines
• Resolution of The Linear-Bounded Automata Question
• Some relations between quantum Turing machines and Turing machines
• Separation of PSPACE and EXP
• Avoiding Contradictions in the Paradoxes, the Halting Problem, and Diagonalization
• Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity
• State-of-Charge Estimation of a Li-Ion Battery using Deep Forward Neural Networks
• Between Turing and Kleene
• Memory and attention in deep learning
• Using biased coins as oracles
• Introduction to quantum information theory
• Does resolving PvNP require a paradigm shift?
• How definitive is the standard interpretation of Goedel's Incompleteness Theorem?
• Expected Outcomes and Manipulations in Online Fair Division
• Autosolvability of halting problem instances for instruction sequences
• Wave Computing based on Dynamical Networks: Applications in Optimization Problems
• 2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years
• The Gremlin Graph Traversal Machine and Language
• Whether a quantum computation employs nonlocal resources is operationally undecidable
• On Empirical Entropy
• Universality in symbolic dynamics constrained by Medvedev degrees
• Design of the Ouroboros packet network
• Type-driven Neural Programming by Example
• Life, The Mind, and Everything
• Finite Computational Structures and Implementations
• Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
• A conditional compression distance that unveils insights of the genomic evolution
• On Controllability of AI
• "Defective" Logic: Using spatiotemporal patterns in coupled relaxation oscillator arrays for computation
• 'Almost Sure' Chaotic Properties of Machine Learning Methods
• A Model for Auto-Programming for General Purposes
• Cheap Non-standard Analysis and Computability
• Minimum Complexity Pursuit for Universal Compressed Sensing
• The Sources of Certainty in Computation and Formal Systems
• The Second Law and Informatics
• A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd
• Undecidability of the Spectral Gap (short version)
• How real are real numbers?
• Engines of Parsimony: Part I; Limits on Computational Rates in Physical\n Systems
• Cell assemblies in the cerebral cortex
• Turing machines, transition systems, and interaction
• A Minimal Active Inference Agent
• On the Uniqueness Problem for Notations of Recursive Ordinals
• Incompleteness for stably consistent formal systems
• Auditory information loss in real-world listening environments
• The universal quantum driving force to speed up a quantum computation -- The unitary quantum dynamics
• Paraconsistent Machines and their Relation to Quantum Computing
• A Game-Semantic Model of Computation
• Neural Stored-program Memory
• Proceedings to the 7th Workshop 'What Comes Beyond the Standard Models', 19. - 31. July 2004, Bled, Slovenia
• Studies in the Theory of Quantum Games
• Dividing by zero - how bad is it, really?
• Information theory and Thermodynamics
• A Distributed Extension of the Turing Machine
• A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization
• Levels of Abstraction and the Apparent Contradictory Philosophical Legacy of Turing and Shannon
• BHN: A Brain-like Heterogeneous Network
• PAC-learning is Undecidable
• A Brief History of AI: How to Prevent Another Winter (A Critical Review)
• Definitively Identifying an Inherent Limitation to Actual Cognition
• Complexification of eukaryote phenotype: Adaptive immuno-cognitive systems as unique Gödelian blockchain distributed ledger
• Elements of Consciousness and Cognition. Biology, Mathematic, Physics and Panpsychism: an Information Topology Perspective
• Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
• First Experiments with PowerPlay
• Locating possible sources of physical indeterminism
• Philosophy in the Face of Artificial Intelligence
• Betwixt Turing and Kleene
• The World is Either Algorithmic or Mostly Random
• Is the Halting problem effectively solvable non-algorithmically, and is the Goedel sentence in NP, but not in P?
• Verifier Theory and Unverifiability
• Theoretical Robopsychology: Samu Has Learned Turing Machines
• Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms
• Quantum Computation: A Computer Science Perspective
• Determining a regular language by glider-based structures called phases fi₁ in Rule 110
• An Apology for Money
• Paraconsistency of Interactive Computation
• The Origins of Computational Mechanics: A Brief Intellectual History and Several Clarifications
• Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum Computer
• A universal alphabet and rewrite system
• Notes on a model for fuzzy computing
• On Automation and Medical Image Interpretation, With Applications for Laryngeal Imaging
• Hypercomputation: computing more than the Turing machine
• Considerations on Classical and Quantum Bits
• The unfolding argument: Why IIT and other causal structure theories cannot explain consciousness
• ‘Incited and Inclined but Not Impelled’: Distinguishing Productivity from Creativity in Artificial Intelligence
• Computable Caratheodory Theory
• A Gentle Introduction to Quantum Computing Algorithms with Applications to Universal Prediction
• The Observer Class Hypothesis
• Decoherence, Control, and Symmetry in Quantum Computers
• On Macroscopic Complexity and Perceptual Coding
• (Physio)logical circuits: The intellectual origins of the McCulloch–Pitts neural networks
• The RAM equivalent of P vs. RP
• Complexity of two-variable Dependence Logic and IF-Logic
• Demuth's path to randomness
• Structural Information Learning Machinery: Learning from Observing, Associating, Optimizing, Decoding, and Abstracting
• Design high-confidence computers using trusted instructional set architecture and emulators
• A New Approach to Abstract Machines - Introduction to the Theory of Configuration Machines
• Periods and elementary real numbers
• Turing Impossibility Properties for Stack Machine Programming
• A Note on the Second Spectral Gap Incompleteness Theorem
• On the principal impossibility to prove P=NP
• Why we must heed Wittgenstein's "notorious paragraph"
• Dynamics and abstract computability: computing invariant measures
• On the Complexity of Inverse Mixed Integer Linear Optimization
• The Past, Present, and Future of Artificial Life
• Principle of Conservation of Computational Complexity
• Types of Cognition and its Implications for future High-Level Cognitive Machines
• Turing-Church thesis, constructve mathematics and intuitionist logic
• Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs
• Computing Bits of Algebraic Numbers
• Generalized Constraints as A New Mathematical Problem in Artificial Intelligence: A Review and Perspective
• Connection errors in networks of linear features and the application of geometrical reduction in spatial data algorithms
• Distinguishing Cause from Effect Using Quantiles: Bivariate Quantile Causal Discovery
• Artificial life: sustainable self-replicating systems
• Testing Randomness by Matching Pennies
• Quantum Computation via Paraconsistent Computation
• From Seed AI to Technological Singularity via Recursively Self-Improving Software
• Power of photonic states: from quantum computation to cosmology
• Origins of Life: A Problem for Physics
• On the Complexity of Real Functions
• POWERPLAY: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem
• Non-computability of human intelligence
• Computability, Noncomputability, and Hyperbolic Systems
• Undecidability and Finite Automata
• Molecular robots guided by prescriptive landscapes
• Informal Physical Reasoning Processes
• Taming the Expressiveness and Programmability of Graph Analytical Queries
• The Doomsday Argument, Consciousness and Many Worlds
• Computational Complexity of Some Quantum Theories in 1+1 Dimensions
• On limitations of learning algorithms in competitive environments
• What Does Information Science Offer for Data Science Research?: A Review of Data and Information Ethics Literature
• Can Laplace's formula model a deterministic universe that is irreducibly probabilistic?
• Quantifying Resource Use in Computations
• Real numbers as infinite decimals -- theory and computation
• Computable Component-wise Reducibility
• Mutation-selection dynamics and error threshold in an evolutionary model for Turing Machines
• Computational Aspects of Dependence Logic
• User Experience with Language-Independent Formal Verification
• An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem
• Consequences of a Goedel's misjudgment
• Mathematical works of Vladimir A. Uspensky: A commentary
• The Axiom of Choice in Computability Theory and Reverse Mathematics, with a cameo for the Continuum Hypothesis
• Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection
• Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
• Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
• Multiple Recurrence and Algorithmic Randomness
• Gödel's Sentence Is An Adversarial Example But Unsolvable
• Is the Halting probability a Dedekind real number?
• Nuclear Spins as Quantum Testbeds: Singlet States, Quantum Correlations,\n and Delayed-choice Experiments
• Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm
• Evaluating the Impact of Information Distortion on Normalized Compression Distance
• Learning Numeracy: Binary Arithmetic with Neural Turing Machines
• Derivatives of Turing machines in Linear Logic
• Unifying Computing and Cognition: The SP Theory and its Applications
• Decision Procedures for Guarded Logics
• Incompleteness theorem for physics
• Addressing mathematical inconsistency: Cantor and Godel refuted
• FALCON-meta: a method to infer metagenomic composition of ancient DNA
• The significance of Nathanson's 'boss' factor in legitimising Aristotle's particularisation: Why we need to revise current interpretations of Cantor's, Goedel's, Turing's and Tarski's formal reasoning
• A Rudimentary Model for Low-Latency Anonymous Communication Systems
• From Safety To Termination And Back: SMT-Based Verification For Lazy Languages
• Can we debug the Universe?
• Continuously Ordered Hierarchies of Algorithmic Information in Digital Twinning and Signal Processing
• Formalisations of further ℵ0-valued Łukasiewicz propositional calculi
• The World’s Technological Capacity to Store, Communicate, and Compute Information
• Solving satisfiability by Bayesian inference
• On the relation between representations and computability
• Quantifying Shannon's Work Function for Cryptanalytic Attacks
• The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities
• An effective version of definability in metric model theory
• A Theory of Interactive Debugging of Knowledge Bases in Monotonic Logics
• Who Discovered the Binary System and Arithmetic? Did Leibniz Plagiarize Caramuel?
• Asymptotic behavior and halting probability of Turing Machines
• Foreword: A Computable Universe, Understanding Computation and Exploring Nature As Computation
• Why we shouldn't fault Lucas and Penrose for continuing to believe in the Goedelian argument against computationalism
• Computing as a Science: A Survey of Competing Viewpoints
• Conscious Intelligence Requires Lifelong Autonomous Programming For General Purposes
• Engines of Parsimony: Part III; Performance Trade-offs for Reversible Computers Sharing Resources
• Axiomatic Theory of Algorithms: Computability and Decidability in Algorithmic Classes
• Software engineering and the SP Theory of Intelligence
• Mechanical Computing: The Computational Complexity of Physical Devices
• Unpredictability and the transmission of numbers
• The Early Development of Programming Languages**The preparation of this paper has been supported in part by National Science Foundation Grant No. MCS 72-03752 A03, by the Office of Naval Research contract N00014-76-C-0330, and by IBM Corporation. The authors wish to thank the originators of the languages cited for their many helpful comments on early drafts of this paper.††Reprinted from J. Belzer, A. G. Holzman, and A. Kent (eds.), “Encyclopedia of Computer Science and Technology,” Vol. 6, pp. 419–493. Dekker, New York, 1977. Courtesy of Marcel Dekker, Inc.
• Information and computation: Classical and quantum aspects
• Computational complexity in electronic structure
• Real Hypercomputation and Continuity
• Effectively open real functions
• Computational Power of Infinite Quantum Parallelism
• Complexity and expressive power of logic programming
• Simplicity versus likelihood in visual perception: From surprisals to precisals.
• P is not equal to NP
• Are Minds Computable?
• Survival Strategies
• Decidability and Universality in Symbolic Dynamical Systems
• Epistemology of Modeling and Simulation: How can we gain Knowledge from Simulations?
• Parallel Computation Is ESS
• Declarativeness: the work done by something else
• Two presumptions in Goedel's interpretation of his own, formal, reasoning that are classically objectionable
• The Impact of Alan Turing: Formal Methods and Beyond
• Colossus: its origins and originators
• Alan Mathison Turing, 1912-1954
• A formal theory of inductive inference. Part II
• A formal theory of inductive inference. Part I
• Stellar Resolution: Multiplicatives
• Three Paradigms of Computer Science
• Growth of Knowledge and Entropy in Quantum Physics
• Finding of k in Fagin's R. Theorem 24
• Recursive real numbers
• Nicht konstruktiv beweisbare Sätze der Analysis
• From Turing machines to computer viruses
• Universality probability of a prefix-free machine
• Sequential abstract-state machines capture sequential algorithms
• The Church-Turing thesis and its look-alikes
• Computability and Recursion
• Computationalism, The Church–Turing Thesis, and the Church–Turing Fallacy
• Philosophy of Mind Is (in Part) Philosophy of Computer Science
• Computability and λ-definability
• It's time to think outside the computational box
• An overview of computational complexity
• Real-Time Computation and Recursive Functions Not Real-Time Computable
• Conception, evolution, and application of functional programming languages
• Breaching or Building Social Boundaries?
• An Implementation of von Neumann's Self-Reproducing Machine
• Nematic bits and universal logic gates
• (In)Efficiency and Reasonable Cost Models
• Max Newman: Topologist, Codebreaker, and Pioneer of Computing
• Poincaré and the early history of 3-manifolds
• How to Compute Spectra with Error Control
• On the complexity of algebraic numbers, II. Continued fractions
• Machines, Logic and Quantum Physics
• The Nature of Computation
• The Classical Decision Problem
• Graph-Rewriting Automata as a Natural Extension of Cellular Automata
• The Generic Model of Computation
• What is a complex system?
• Pure functions in APL and J
• Expressivity in Natural and Artificial Systems
• Recursive Unsolvability of a problem of Thue
• The Upper Semi-Lattice of Degrees of Recursive Unsolvability
• Computability
• Recursively enumerable sets of positive integers and their decision problems
• On notation for ordinal numbers
• Toward the Minimal Universal Petri Net
• On the implications of computer viruses and methods of defense
• Propositions as types
• Genetic programming with polymorphic types and higher-order functions
• The Beginning of Model Checking: A Personal Perspective
• On the mathematical and foundational significance of the uncountable
• A Local Information Criterion for Dynamical Systems
• Shannon-inspired Statistical Computing to Enable Spintronics
• Positional Value and Linguistic Recursion
• A Road Map to Strong Intelligence
• On the lexicographic representation of numbers
• Operational derivation of Boltzmann distribution with Maxwell’s demon model
• Invertible cellular automata: A review
• Warren McCulloch and the British Cyberneticians
• The origins of combinatorics on words
• Information Processing: The Language and Analytical Tools for Cognitive Psychology in the Information Age
• Observations About the Development of Theoretical Computer Science
• Sustaining Moore's Law Through Inexactness
• Security and the incalculable
• Modular-topology optimization with Wang tilings: an application to truss structures
• Epistemic Horizons and the Foundations of Quantum Mechanics
• On the Remarkable Features of Binding Forms
• The SP Theory of Intelligence: Distinctive Features and Advantages
• Arbitrary Arrow Update Logic with Common Knowledge is neither RE nor co-RE
• Philosophical Solution to P=?NP: P is Equal to NP
• Undecidability of the Spectral Gap (full version)
• Classical emulation of a quantum computer
• The unreasonable effectiveness of Nonstandard Analysis
• Separable Operations, Graph Codes and the Location of Quantum Information
• Evolutionary model with Turing machines
• On equational completeness theorems
• Means-fit effectivity
• Statistical mechanics of the vertex-cover problem
• On Quantifying and Understanding the Role of Ethics in AI Research: A Historical Account of Flagship Conferences and Journals
• The Residue of Uniqueness
• Interaction and Resistance: The Recognition of Intentions in New Human-Computer Interaction
• Seven Survival Senses: Evolutionary Training Makes Discerning Differences More Natural Than Spotting Similarities
• Fading memory and kernel properties of generic cortical microcircuit models
• Game Theory with Costly Computation
• An Intensional Concurrent Faithful Encoding of Turing Machines
• A nonclassical symbolic theory of working memory, mental computations, and mental set
• A Universal Hypercomputer
• Computability, Gödel's incompleteness theorem, and an inherent limit on the predictability of evolution
• Reverse mathematics of rings
• Interactive Small-Step Algorithms I: Axiomatization
• Physically-relativized Church–Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics
• Chance and necessity do not explain the origin of life
• Rhythms of Memory and Bits on Edge: Symbol Recognition as a Physical Phenomenon
• Beyond the Turing Test
• Analysing choice sequences
• Alan Turing [wikipedia]
• Automatic Computing Engine [wikipedia]
• Church–Turing thesis [wikipedia]
• Claude Shannon [wikipedia]
• Computability theory [wikipedia]
• Computable number [wikipedia]
• Computer [wikipedia]
• Definable real number [wikipedia]
• Halting problem [wikipedia]
• History of computing [wikipedia]
• History of computing hardware [wikipedia]
• History of the Church–Turing thesis [wikipedia]
• Manchester Mark 1 [wikipedia]
• Max Newman [wikipedia]
• Timeline of artificial intelligence [wikipedia]
• Turing's proof [wikipedia]
• Turing machine [wikipedia]
• Von Neumann architecture [wikipedia]
• A mechanical Turing machine: blueprint for a biomolecular computer. [europepmc]
• Pattern perception and computational complexity: introduction to the special issue. [europepmc]
• The neurobiology of syntax: beyond string sets. [europepmc]
• The algorithmic origins of life. [europepmc]
• Objects of consciousness. [europepmc]
• Is life unique? [europepmc]
• Artificial Molecular Machines. [europepmc]
• Inferring Contacting Residues within and between Proteins: What Do the Probabilities Mean? [europepmc]
• Universal biology and the statistical mechanics of early life. [europepmc]
• Algorithmically probable mutations reproduce aspects of evolution, such as convergence rate, genetic memory and modularity. [europepmc]
• Zipf's Law, unbounded complexity and open-ended evolution. [europepmc]
• Uncertainty and computational complexity. [europepmc]
• Plant behaviour in response to the environment: information processing in the solid state. [europepmc]
• The computational stance in biology. [europepmc]
• Pathways to cellular supremacy in biocomputing. [europepmc]
• Computing Endolymph Hydrodynamics During Head Impulse Test on Normal and Hydropic Vestibular Labyrinth Models. [europepmc]
• Artificial Intelligence in Pharmacoepidemiology: A Systematic Review. Part 1-Overview of Knowledge Discovery Techniques in Artificial Intelligence. [europepmc]
• From Microbial Communities to Distributed Computing Systems. [europepmc]
• Absolute configuration and host-guest binding of chiral porphyrin-cages by a combined chiroptical and theoretical approach. [europepmc]
• A Review of Graph and Network Complexity from an Algorithmic Information Perspective. [europepmc]
• How Incomputable Is Kolmogorov Complexity? [europepmc]
• Advancements in Microprocessor Architecture for Ubiquitous AI-An Overview on History, Evolution, and Upcoming Challenges in AI Implementation. [europepmc]
• State-switching and high-order spatiotemporal organization of dynamic functional connectivity are disrupted by Alzheimer's disease. [europepmc]
• Machine Learning and Digital Biomarkers Can Detect Early Stages of Neurodegenerative Diseases. [europepmc]
• Naturalizing relevance realization: why agency and cognition are fundamentally not computational. [europepmc]

Discussions

• Turing, A. M. 1936. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (3): 230–265. doi.org/10.1112/plms... [bsky, 0 points, 1 comments]