Upper and lower bounds on continuous-time computation

被引：0
|
作者：
Campagnolo, ML [1 ]
Moore, C [1 ]
机构：
[1] Univ Tecn Lisboa, ISA, DM, Lisbon, Portugal
来源：
UNCONVENTIONAL MODELS OF COMPUTATION UMC' 2K, PROCEEDINGS | 2001年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuous time. We show that several classical computation classes have natural analog counterparts, including the primitive recursive functions, the elementary functions, the levels of the Grzegorczyk hierarchy, and the arithmetical and analytical hierarchies.
引用
收藏
页码：135 / 153
页数：19
相关论文
共 50 条
12345