A direct method for simulating partial recursive functions by Diophantine equations
type: Item
instance of: scholarly article
title: A direct method for simulating partial recursive functions by Diophantine equations
zbMATH Open document ID: 0795.03054
DOI: 10.1016/0168-0072(94)90014-0
published in: Annals of Pure and Applied Logic
publication date: 1994-09-01T00:00:00Z
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 11D99
Mathematics Subject Classification ID: 11U99
zbMATH DE Number: 584687
zbMATH Keywords: exponential Diophantine representation of recursively enumerable predicates
zbMATH Keywords: partial recursive function
author: Yu. Matiyasevich
MaRDI profile type: Publication
full work available at URL: 0168-0072(94)90014-0
OpenAlex ID: W2084860043
cites work: A sharp version of the bounded Matijasevich conjecture and the end-extension problem
cites work: Q4161318
cites work: Arithmetical problems and recursively enumerable predicates
cites work: Q3346295
cites work: An explicit diophantine definition of the exponential function
cites work: Hilbert's Tenth Problem is Unsolvable
cites work: Q4115143
cites work: The decision problem for exponential diophantine equations
cites work: Q3962995
cites work: A proof of negative answer to Hilbert's $10$th problem
cites work: Q3964549
cites work: Register machine proof of the theorem on exponential diophantine representation of enumerable sets
cites work: Proof of Recursive Unsolvability of Hilbert's Tenth Problem
cites work: Diophantine induction
cites work: Q5812175
cites work: How to Program an Infinite Abacus
cites work: NP-complete decision problems for binary quadratics
cites work: Q4160889
cites work: A new proof of the theorem on exponential diophantine representation of enumerable sets
cites work: On investigations on some algorithmic problems in algebra and number theory
cites work: Q3992465
cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns
cites work: An Informal Arithmetical Approach to Computability and Computation
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Q5590814
cites work: An unsolvable problem in number theory
cites work: Existential Definability in Arithmetic
cites work: Computability of Recursive Functions
cites work: Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
cites work: A note on the number of zeros of polynomials and exponential polynomials
cites work: Logical number theory I. An introduction
cites work: Q3893912
Recommended article: A recursive algorithm for coprime fractions and Diophantine equations
Recommended article: Q4714022
Recommended article: Q3483341
Recommended article: Q3912654
Recommended article: Q3778060
Recommended article: Q5500857
Recommended article: Q3828961
Recommended article: Computational complexities of diophantine equations with parameters
Recommended article: A recursive algorithm for the incomplete partial fraction decomposition
Recommended article: Numerically satisfactory solutions of hypergeometric recursions
description: scientific article; zbMATH DE number 584687