scientific article; zbMATH DE number 3539209
From MaRDI portal
zbMath0346.02026MaRDI QIDQ4115143
Julia Robinson, Yu. V. Matiyasevich, Martin Davis
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability (number-theoretic aspects) (11U05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99)
Related Items
A direct method for simulating partial recursive functions by Diophantine equations, Division-ample sets and the Diophantine problem for rings of integers, Riemann's hypothesis as an eigenvalue problem, Further results on Hilbert's tenth problem, Partial evaluation and \(\omega\)-completeness of algebraic specifications, Diophantine definability and decidability in extensions of degree 2 of totally real fields, Symbioses between mathematical logic and computer science, Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, An undecidability result for AGh, The logic of pseudo-\(S\)-integers, The quest for Diophantine finite-fold-ness, Existential definability and diophantine stability, Existential Diophantine definability of string length, On some algebraic ways to calculate zeros of the Riemann zeta function, Elliptic curves retaining their rank in finite extensions and Hilbert's Tenth Problem for rings of algebraic numbers, The Riemann hypothesis as the parity of special binomial coefficients, Seven Kinds of Computable and Constructive Infelicities in Economics, Model-theoretic aspects of unification, Hilbert's tenth problem for fields of rational functions over finite fields, On some decision problems for RAM programs, On a theorem of Matiyasevich, On nonstochastic languages and homomorphic images of stochastic languages, Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation, Uniform existential interpretation of arithmetic in rings of functions of positive characteristic, Defining integrality at prime sets of high density in number fields., Hilbert's Tenth Problem for rings of algebraic functions of characteristic 0, Unnamed Item, My Life as a Logician, Martin Davis and Hilbert’s Tenth Problem, Extensions of Hilbert’s Tenth Problem: Definability and Decidability in Number Theory, A Story of Hilbert’s Tenth Problem, Pragmatic Platonism, Pragmatic Platonism, Existential definability with bounds on archimedean valuations, My collaboration with Julia Robinson, Diophantine definability and decidability in large subrings of totally real number fields and their totally complex extensions of degree 2, Diophantine equations and the generalized Riemann hypothesis, Some arithmetical restatements of the four color conjecture, On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases, About the decision of reachability for register machines, On decision problems for parameterized machines, Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks, Unnamed Item, Diophantine complexity, Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm, On algebraic specifications of computable algebras with the discriminator technique, Remarks on commutative N-rational series, The Riemann hypothesis in computer science, The equality problem for rational series with multiplicities in the tropical semiring is undecidable, A public key cryptosystem based on Diophantine equations of degree increasing type, Rumely's local global principle for weakly P\(\mathcal S\)C fields over holomorphy domains, Diophantine undecidability of holomorphy rings of function fields of characteristic 0, On some bounded semiAFLs and AFLs, A key exchange protocol based on Diophantine equations and S-integers, A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets, Propositional dynamic logic of nonregular programs, On diophantine equations over the ring of all algebraic integers, Definability and decidability in infinite algebraic extensions, Which data types have \(\omega\)-complete initial algebra specifications?
