What is recorded here?
Matiyasevich supplied a Diophantine representation of exponential growth, completing the prior Davis–Putnam–Robinson route from enumerable predicates to polynomial equations and the impossibility of a general integer-solvability algorithm.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The four names credit the mathematical development; the 1970 paper itself is authored by Matiyasevich. General undecidability does not prevent solving individual equations or restricted classes. Integer, nonnegative-integer and positive-integer formulations are related by the reductions noted in the source.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Yu. V. Matiyasevich; Martin Davis; Hilary Putnam; Julia Robinson
Listed source contributors; individual labor shares are not measured
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Hilbert’s tenth problem: the negative solution
Matiyasevich supplied a Diophantine representation of exponential growth, completing the prior Davis–Putnam–Robinson route from enumerable predicates to polynomial equations and the impossibility of a general integer-solvability algorithm.
Scientific scope
The four names credit the mathematical development; the 1970 paper itself is authored by Matiyasevich. General undecidability does not prevent solving individual equations or restricted classes. Integer, nonnegative-integer and positive-integer formulations are related by the reductions noted in the source.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Yu. V. Matiyasevich; Martin Davis; Hilary Putnam; Julia Robinson
Listed source contributors; individual labor shares are not measured