|
Mathematics
Unsolvability of some problems on piecewise polynomial functions
S. B. Gashkovab a Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b Moscow Center for Fundamental and Applied Mathematics
Abstract:
The algorithmic unsolvability is proved for some problems concerning piecewise polynomials of one variable with infinite number of nodes.
Key words:
piece-polynomial functions, Diophantine equations, algorithmic unsolvability.
Received: 02.09.2022
Citation:
S. B. Gashkov, “Unsolvability of some problems on piecewise polynomial functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2023, no. 3, 8–15; Moscow University Mathematics Bulletin, 78:3 (2023), 112–119
Linking options:
https://www.mathnet.ru/eng/vmumm4534 https://www.mathnet.ru/eng/vmumm/y2023/i3/p8
|
Statistics & downloads: |
Abstract page: | 101 | Full-text PDF : | 67 | References: | 21 |
|