New Computational Paradigms

DOI10.1007/b136981zbMath1115.03004OpenAlexW2278484831MaRDI QIDQ5717055

Yu. V. Matiyasevich

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136981

zbMATH Keywords

survey

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) History of mathematics in the 20th century (01A60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of number theory (11-03) Decidability of theories and sets of sentences (03B25) History of mathematical logic and foundations (03-03) Theory of computing (68Qxx) Computability and recursion theory (03Dxx)

Related Items (5)

The undecidability of proof search when equality is a logical connective ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ On Post correspondence problem for letter monotonic languages ⋮ On the power of recursive word-functions without concatenation

This page was built for publication: New Computational Paradigms