Unsolvability of Some Problems about Piecewise-Polynomial Functions

被引:0
|
作者
Gashkov, S. B. [1 ,2 ]
机构
[1] Moscow Ctr Fundamental & Appl Math, Moscow, Russia
[2] Lomonosov Moscow State Univ, Fac Mech & Math, Chair Discrete Math, Moscow, Russia
关键词
piecewise-polynomial functions; Diophantine equations; algorithmic unsolvability; BOOLEAN FUNCTIONS;
D O I
10.3103/S0027132223030038
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The algorithmic unsolvability is proved for some problems concerning piecewise polynomials of one variable with infinite number of nodes.
引用
收藏
页码:112 / 119
页数:8
相关论文
共 50 条