𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems

✍ Scribed by O. Bournez

Publisher
Springer
Year
1999
Tongue
English
Weight
760 KB
Volume
32
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the computational power of self-stabi
On the computational power of self-stabilizing systems
✍ James Abello; Shlomi Dolev πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 859 KB

The computational power of self-stabilizing distributed systems is examined. Assuming availability of any number of processors, each with (small) constant size memory we show that any computable problem can be realized in a self-stabilizing fashion. The result is derived by presenting a distributed

On the computational power of context-fr
On the computational power of context-free PC grammar systems
✍ Niculae Mandache πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 132 KB

It is shown that non-returning parallel communicating grammar systems with -free contextfree components can generate any recursively enumerable language. Since it was proven that such systems can be simulated by returning PC grammar systems with context-free components, the result extends to those.

Limits on the computing power of biologi
Limits on the computing power of biological systems
✍ Michael Conrad; Arnon Rosenthal πŸ“‚ Article πŸ“… 1981 πŸ› Springer 🌐 English βš– 457 KB

The theory of computational complexity and certain explicitly-stated hypotheses imply limitations on the information processing power of biological systems. Parallelism, special purpose organization, and analog mechanisms may provide speedup critical for life processes, but have little power in the