Undecidable propositions by Ode's

被引：0
|
作者：
Buser, Peter
Scarpellini, Bruno
机构：
[1] Ecole Polytech Fed Lausanne, Sect Math, IGAT, SB,GEOM, CH-1015 Lausanne, Switzerland
[2] Univ Basel, Dept Math, CH-4051 Basel, Switzerland
来源：
ANNALES ACADEMIAE SCIENTIARUM FENNICAE-MATHEMATICA | 2007年 / 32卷 / 02期
关键词：
recursively enumerable sets; theta functions; ordinary differential equations; hylpercomputation;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Starting with elementary functions, we generate new functions by multiplication, integration and by solving ODE's so as to obtain a family M of real holomorphic functions such that: (*) if E subset of N is recursively enumerable then there is f is an element of M such that n is an element of E iff integral(-pi) (+pi) f(x)e-(in x) dx not equal 0. Constructive aspects and relations to hypercomputation are discussed.
引用
收藏
页码：317 / 340
页数：24
相关论文
共 50 条
12345