Computability and the morphological complexity of some dynamics on continuous domains

被引：4
|
作者：
Hoyrup, Mathieu
Kolcak, Arda
Longo, Giuseppe [1 ]
机构：
[1] CNRS, Lab Informat, Paris, France
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 398卷 / 1-3期
关键词：
computability over continuous domains; decidability; unpredictability; chaotic dynamics; singularities; shadowing;
D O I：
10.1016/j.tcs.2008.01.048
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The partially ordered set of compact intervals provides a convenient embedding space for the analysis of some Dynamical Systems. Crucial dynamical properties are transferred to it, while allowing an investigation of stability and chaoticity, in terms of computability, in particular in the presence of singularities. We will survey some results which display the connections between the geometric complexity of the dynamics and computability issues, as well as new relations between dynamic predictability and effective decidability. (C) 2008 Published by Elsevier B.V.
引用
收藏
页码：170 / 182
页数：13
相关论文
共 50 条
12345