On Computable Numbers, with an Application to the Entscheidungsproblem
From MaRDI portal
Publication:5765445
DOI10.1112/plms/s2-42.1.230zbMath0016.09701OpenAlexW2126160338WikidataQ25864184 ScholiaQ25864184MaRDI QIDQ5765445
Publication date: 1936
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-42.1.230
Related Items (only showing first 100 items - show all)
Dynamic Reasoning Systems ⋮ Телеология и целенаправленное поведение: логический анализ ⋮ The theory of languages ⋮ Recursive Predicates and Quantifiers ⋮ Semi-effective numberings and definitions of the computable numbers ⋮ The challenge of computer mathematics ⋮ The theory of languages ⋮ Computational unsolvability of domains of attraction of nonlinear systems ⋮ On restricted turing computability ⋮ Unnamed Item ⋮ On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus ⋮ Hobson’s Conception of Definable Numbers ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ Computation models and function algebras ⋮ Looking at Euler flows through a contact mirror: universality and undecidability ⋮ The foundations of spectral computations via the solvability complexity index hierarchy ⋮ Formal and Natural Proof: A Phenomenological Approach ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ Heuristic programming: A survey ⋮ Kurt Gödel's Anticipation of the Turing Machine: A Vitalistic Approach ⋮ The decision problem for effective procedures ⋮ The Riemann hypothesis as the parity of special binomial coefficients ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ A natural generalization of the Turing computability model ⋮ Separability, contextuality, and the quantum frame problem ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Probabilistic Turing Machines and Computability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations ⋮ Superintelligence Cannot be Contained: Lessons from Computability Theory ⋮ When series of computable functions with varying domains are computable ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Agent-Based Modeling and Artificial Life ⋮ Programming in Biomolecular Computation ⋮ Physical Computational Complexity and First-order Logic ⋮ Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines ⋮ Revisiting the simulation of quantum Turing machines by quantum circuits ⋮ Church’s thesis and its relation to the concept of realizability in biology and physics ⋮ Computability by Probabilistic Turing Machines ⋮ Meanings of Model Checking ⋮ On the hierarchies of Δ20-real numbers ⋮ On the computability of rotation sets and their entropies ⋮ Quantifier elimination by cylindrical algebraic decomposition based on regular chains ⋮ Logspace computations in graph products ⋮ Tame decompositions and collisions ⋮ Non-computable Julia sets ⋮ Contributions to the reduction theory of the decision problem ⋮ On the mathematical and foundational significance of the uncountable ⋮ Contributions to the reduction theory of the decision problem ⋮ A computational definition of financial randomness ⋮ Motivation for working in numerical analysis ⋮ Turing-Complete Subclasses of CHR ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Veridical data science ⋮ Monogenic normal systems are universal ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ Wittgenstein’s Diagonal Argument: A Variation on Cantor and Turing ⋮ Modal Satisfiability via SMT Solving ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages ⋮ Mathematics, Metaphysics and the Multiverse ⋮ The Legacy of Turing in Numerical Analysis ⋮ Turing Machines for Dummies ⋮ What Is an Algorithm? ⋮ The Complexity of Small Universal Turing Machines: A Survey ⋮ A Short Introduction to Implicit Computational Complexity ⋮ Turing-machines and the Entscheidungsproblem ⋮ Procedures for searching local solutions of linear differential systems with infinite power series in the role of coefficients ⋮ Fair play for machines ⋮ Mathematics by machine ⋮ Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers ⋮ Sparse interpolation over finite fields via low-order roots of unity ⋮ Multivariate sparse interpolation using randomized Kronecker substitutions ⋮ Computing the differential Galois group of a parameterized second-order linear differential equation ⋮ A new deterministic algorithm for sparse multivariate polynomial interpolation ⋮ A fast algorithm for computing the characteristic polynomial of the p-curvature ⋮ Computing necessary integrability conditions for planar parametrized homogeneous potentials ⋮ Improved algorithm for computing separating linear forms for bivariate systems ⋮ Solving higher order linear differential equations having elliptic function coefficients ⋮ Parallel telescoping and parameterized Picard-Vessiot theory ⋮ A generalized Apagodu-Zeilberger algorithm ⋮ The asymptotic analysis of some interpolated nonlinear recurrence relations ⋮ Fast arithmetic for the algebraic closure of finite fields ⋮ On the computation of the topology of plane curves ⋮ Essentially optimal interactive certificates in linear algebra ⋮ Root counts of semi-mixed systems, and an application to counting nash equilibria ⋮ Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation) ⋮ Sub-cubic change of ordering for Gröbner basis ⋮ Sparse Gröbner bases ⋮ The MMO problem ⋮ Factoring linear differential operators in n variables ⋮ Online order basis algorithm and its impact on the block Wiedemann algorithm ⋮ On isomorphisms of modules over non-commutative PID ⋮ Radical solutions of first order autonomous algebraic ordinary differential equations ⋮ Computing low-degree factors of lacunary polynomials ⋮ Maximum likelihood geometry in the presence of data zeros ⋮ Constructing fewer open cells by GCD computation in CAD projection
This page was built for publication: On Computable Numbers, with an Application to the Entscheidungsproblem
