Hilbert's tenth problem and paradigms of computation

Authors:
Yuri Matiyasevich
Affiliations:
Steklov Institute of Mathematics Laboratory of Mathematical Logic, St.Petersburg, Russia
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 9
Cited 1

Algorithmic information theory

Algorithmic information theory
Proof or recursive unsolvability of Hilbert's tenth problem

American Mathematical Monthly
Hilbert's tenth problem

Hilbert's tenth problem
Computability of Recursive Functions

Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
On the existence of a new family of Diophantine equations for Ω

Fundamenta Informaticae
Computation: finite and infinite machines

Computation: finite and infinite machines
Computational complexity of decision procedures for polynomials

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Diophantine complexity

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science

On post correspondence problem for letter monotonic languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is a survey of a century long history of interplay between Hilbert's tenth problem (about solvability of Diophantine equations) and different notions and ideas from the Computability Theory.