On investigations on some algorithmic problems in algebra and number theory

MaRDI QIDQ1820152zbMATH OpenFDO

Authors Yu. Matiyasevich

Publication date 1986

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

zbMATH Keywords

algorithmic unsolvabilityHilbert's 10th problemmatrix representabilityrecognition of invariant propertiessurveyword problem

Mathematics Subject Classification ID

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

Review text

Translation from Tr. Mat. Inst. Steklova 168, 218-235 (Russian) (1984; Zbl 0597.03020).

Cited in

(9)

• Investigations on algorithmic questions of algebra
• A direct method for simulating partial recursive functions by Diophantine equations
• Martin Davis and Hilbert's tenth problem
• scientific article; zbMATH DE number 3875525 (Why is no real title available?)
• scientific article; zbMATH DE number 5524164 (Why is no real title available?)
• scientific article; zbMATH DE number 3961588 (Why is no real title available?)
• scientific article; zbMATH DE number 41267 (Why is no real title available?)
• scientific article; zbMATH DE number 730035 (Why is no real title available?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820152)