On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
From MaRDI portal
Publication:5768086
DOI10.1112/plms/s2-43.6.544zbMath0018.19304OpenAlexW2022731279WikidataQ27638524 ScholiaQ27638524MaRDI QIDQ5768086
Publication date: 1937
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s2-43.6.544
Related Items (63)
The complexity of analog computation ⋮ A semilattice of degrees of computable metrics ⋮ New degree spectra of Polish spaces ⋮ Simple urban simulation atop complicated models: multi-scale equation-free computing of sprawl using geographic automata ⋮ Symbioses between mathematical logic and computer science ⋮ Some remarks on real numbers induced by first-order spectra ⋮ A look back on the 20th century ⋮ Computability and Analysis, a Historical Approach ⋮ Computable reducibility of metrics on the reals ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Real-time computability of real numbers by chemical reaction networks ⋮ Using macrotransducers to specify partial continuous operators in metric spaces ⋮ Can abstract state machines be useful in language theory? ⋮ From Turing machines to computer viruses ⋮ Unnamed Item ⋮ Hierarchies of number-theoretic predicates ⋮ Indirect addressing and the time relationships of some models of sequential computation ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Superefficiency from the vantage point of computability ⋮ Deciding program properties via complete abstractions on bounded domains ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ Beta-shifts, their languages, and computability ⋮ Reducibility of computable metrics on the real line ⋮ Conservative logic ⋮ Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability ⋮ Appraising two decades of distributed computing theory research ⋮ Real Number Calculations and Theorem Proving ⋮ When good theories make bad predictions ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Efficiently embedding QUBO problems on adiabatic quantum computers ⋮ Notes on computable analysis ⋮ Algorithmic randomness and Fourier analysis ⋮ On approximations for functions in the space of uniformly convergent Fourier series ⋮ The diagonalization method in quantum recursion theory ⋮ Is there any real substance to the claims for a ``new computationalism? ⋮ Computability, noncomputability, and hyperbolic systems ⋮ On the hierarchies of Δ20-real numbers ⋮ Computable topological groups and Pontryagin duality ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ Computable structures and operations on the space of continuous functions ⋮ On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited ⋮ Deductive derivation and turing-computerization of semiparametric efficient estimation ⋮ Investigations on the approximability and computability of the Hilbert transform with applications ⋮ Mathematical and Technological Computability ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer ⋮ Multi-Resolution Cellular Automata for Real Computation ⋮ Mutual Dimension ⋮ On approximate and algebraic computability over the real numbers ⋮ Markov's constructive analysis; a participant's view ⋮ Computation by `While' programs on topological partial algebras ⋮ Randomness for non-computable measures ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Synthesizing ranking functions for loop programs via SVM ⋮ Motivation for working in numerical analysis ⋮ Recasting Stefano Zambelli: Notes on the Foundations of Mathematics for a Post-Neoclassical Age in Economics ⋮ Computable topological abelian groups ⋮ Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems ⋮ Counter machines ⋮ Links between physics and set theory. ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
This page was built for publication: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
