Pages that link to "Item:Q1349871"
From MaRDI portal
The following pages link to On the computational power of dynamical systems and hybrid systems (Q1349871):
Displaying 21 items.
- Retracted: Universal computation is `almost surely' chaotic (Q403026) (← links)
- A dynamical model of parallel computation on bi-infinite time-scale (Q629413) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- Infinite traces and symbolic dynamics (Q841627) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
- Physical constraints on hypercomputation (Q2482458) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- The impact of models of a physical oracle on computational power (Q2919942) (← links)
- AN ANALOGUE-DIGITAL CHURCH-TURING THESIS (Q2929623) (← links)
- The promise of analog computation (Q2930715) (← links)
- Limits to measurement in experiments governed by algorithms (Q3061157) (← links)
- Conservatively Approximable Functions (Q3455861) (← links)
- Some bounds on the computational power of piecewise constant derivative systems (extended abstract) (Q4571947) (← links)
- Computations with oracles that measure vanishing quantities (Q4593234) (← links)
- THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY (Q5176163) (← links)
- Computational complexity with experiments as oracles (Q5505107) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Deciding stability and mortality of piecewise affine dynamical systems (Q5941097) (← links)
- The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
