Computation Paradigms in Light of Hilbert's Tenth Problem-Reference-Cited by-同舟云学术

Computation Paradigms in Light of Hilbert's Tenth Problem

Published:2008 Issue: Volume: Page:59-85
ISSN:
Container-title:New Computational Paradigms
language:
Short-container-title:

Author:

Matiyasevich Yuri

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-68546-5_4.pdf

Reference135 articles.

1. Adleman L., Manders K.: Diophantine complexity. In: 17th Annual Symposium on Foundations of Computer Science, 81-88 (1976)

2. Adler A.: Some recursively unsolvable problems in analysis. Proceedings of the American Mathematical Society, 22(2):523-526 (1969)

3. Araki, T., Kasami, T.: Some undecidable problems for Petri nets. Systems-Computers-Controls, 7(1):20-28 (1976); Japanese original: Denshi Tsushin Gakkai Ronbunshi, 59D:25-32 (1976)

4. Baader, F., Siekmann, J. H.: Unification theory. In: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2, 41-125, Oxford Univ. Press, New York (1994)

5. Baaz, M.: Note on the existence of most general semi-unifier. Arithmetic, Proof Theory, and Computational Complexity (Prague, 1991), 20-29, Oxford Logic Guides, Vol. 23, Oxford Univ. Press, New York (1993)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Meaning Maximization Doctrine: An Alternative to the Utilitarian Doctrine;Keynesian, Sraffian, Computable and Dynamic Economics;2020-09-05

2. A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving;Programming Languages and Systems;2020

3. Theory and practice of string solvers (invited talk abstract);Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis;2019-07-10

4. Chain-Free String Constraints;Automated Technology for Verification and Analysis;2019

5. Word Equations with Length Constraints: What’s Decidable?;Hardware and Software: Verification and Testing;2013