𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computability and the morphological complexity of some dynamics on continuous domains

✍ Scribed by Mathieu Hoyrup; Arda Kolçak; Giuseppe Longo

Book ID
108281407
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
434 KB
Volume
398
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The computational complexity of some fuz
The computational complexity of some fuzzy dynamic programs
✍ A.O. Esogbue 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Fuzzy dynamic programming, a natural extension of classical dynamic programming, is of great appeal in the modeling and control of certain systems, especially those of a socio-technical systems nature. However, data acquisition, manipulation, and processing create immense problems to the systems des

On the metric complexity of continuous-t
On the metric complexity of continuous-time systems
✍ Le Yi Wang; Lin Lin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

In this paper, metric complexities of certain classes of continuous-time systems are studied, using the time-domain sampling approach and the concepts of Kolmogorov, Gel'fand and sampling n-widths for certain classes of Sobolev space. A sampling theorem is obtained which extends Shannon's sampling t