On investigations on some algorithmic problems in algebra and number theory

zbMATH Open0614.03036MaRDI QIDQ1820152FDOQ1820152

Authors: Yu. Matiyasevich 

Publication date: 1986

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

zbMATH Keywords

surveyword problemalgorithmic unsolvabilityHilbert's 10th problemmatrix representabilityrecognition of invariant properties

Mathematics Subject Classification ID

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) Development of contemporary mathematics (01A65) Free semigroups, generators and relations, word problems (20M05) Schools of mathematics (01A72) Undecidability and degrees of sets of sentences (03D35) Decidability (number-theoretic aspects) (11U05) Computability and recursion theory (03Dxx)

Cited In (9)

• Martin Davis and Hilbert's tenth problem
• The developments of the concept of machine computability from 1936 to the 1960s
• Title not available (Why is that?)
• Title not available (Why is that?)
• A direct method for simulating partial recursive functions by Diophantine equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Investigations on algorithmic questions of algebra

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)