Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Yuri Matiyasevich"'
Autor:
Yuri Matiyasevich
Publikováno v:
Algebraic Informatics ISBN: 9783031196843
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32ab25d0e6376e9a0c957cce7dda2970
https://doi.org/10.1007/978-3-031-19685-0_2
https://doi.org/10.1007/978-3-031-19685-0_2
Autor:
Yuri Matiyasevich
This book presents the full, self-contained negative solution of Hilbert's 10th problem. At the 1900 International Congress of Mathematicians, held that year in Paris, the German mathematician David Hilbert put forth a list of 23 unsolved problems th
Publikováno v:
International Journal of Number Theory. 16:981-1003
In this paper, we establish some congruences involving the Apéry numbers [Formula: see text]. For example, we show that [Formula: see text] for any positive integer [Formula: see text], and [Formula: see text] for any prime [Formula: see text], wher
Publikováno v:
Fundamenta Informaticae. 154:177-184
Autor:
Yuri Matiyasevich
Publikováno v:
Algorithms and Complexity in Mathematics, Epistemology, and Science ISBN: 9781493990504
Riemann’s zeta function (defined by a certain Dirichlet series) satisfies an identity known as the functional equation. H. Hamburger established that the function is identified by the equation inside a wide class of functions defined by Dirichlet s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::277dfb73d89650fab51dc0b331979876
https://doi.org/10.1007/978-1-4939-9051-1_8
https://doi.org/10.1007/978-1-4939-9051-1_8
A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
Autor:
Gleb Beliakov, Yuri Matiyasevich
Publikováno v:
BIT Numerical Mathematics. 56:33-50
We present a parallel algorithm for calculating determinants of matrices in arbitrary precision arithmetic on computer clusters. This algorithm limits data movements between the nodes and computes not only the determinant but also all the minors corr
Publikováno v:
Acta Arithmetica. 166:189-200
As usual let s = �+it. For any fixed value t = t0 with |t0| ≥ 8, and for � ≤ 0, we show that |�(s)| is strictly monotone decreasing in �
Autor:
Yuri Matiyasevich
Publikováno v:
Outstanding Contributions to Logic ISBN: 9783319418414
Martin Davis on Computability, Computational Logic, and Mathematical Foundations
Martin Davis on Computability, Computational Logic, and Mathematical Foundations
The paper presents the history of the negative solution of Hilbert’s tenth problem , the role played in it by Martin Davis, consequent modifications of the original proof of DPRM-theorem, its improvements and applications, and a new (2010) conjectu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9797af153abbc622eb2c5b2ac5d5b545
https://doi.org/10.1007/978-3-319-41842-1_2
https://doi.org/10.1007/978-3-319-41842-1_2
Autor:
Yuri Matiyasevich
Publikováno v:
Illinois J. Math. 60, no. 1 (2016), 185-205
Scopus-Elsevier
Scopus-Elsevier
The Four Color Conjecture, which in 1977 became the Four Color Theorem of Kenneth Appel and Wolfgang Haken, is famous for the number of its reformulations. Three of them found by the author at different time are discussed in this paper.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ba24200a99bcbe097b4ac16a84a7779
http://projecteuclid.org/euclid.ijm/1498032030
http://projecteuclid.org/euclid.ijm/1498032030
Publikováno v:
Fundamenta Informaticae. 162:i-i