On investigations on some algorithmic problems in algebra and number theory

zbMath0614.03036MaRDI QIDQ1820152

Yu. V. Matiyasevich

Publication date: 1986

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

surveyword problemHilbert's 10th problemalgorithmic unsolvabilitymatrix representabilityrecognition of invariant properties

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35) Development of contemporary mathematics (01A65) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) History of mathematical logic and foundations (03-03) Schools of mathematics (01A72) Computability and recursion theory (03Dxx)

Related Items (3)

A direct method for simulating partial recursive functions by Diophantine equations ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s

This page was built for publication: On investigations on some algorithmic problems in algebra and number theory